Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, December 16, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Rom Pinchasi (Technion, Israel)

Some new results related to the 'halving lines problem'

We introduce several interrelated results concerning with halving lines of a set of $n$ points in the plane and measure concentration in the plane. We will be motivated by the following result:

For every $\epsilon>0$ there exists $\alpha(\epsilon)>0$ such that for every continuous probability measure $\mu$ in the plane one can find two lines that cross at an angle of $\alpha(\epsilon)$ such that the measure $\mu$ of each of the two quadrants of angle $\pi-\alpha(\epsilon)$ is at least $1/2-\epsilon$.

We will provide lower bounds for the maximum possible value of $\alpha(\epsilon)$ and show how this problem is related to the halving lines problem. We will also present some new results concerning halving lines.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login