Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, April 30, 2013, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: József Solymosi (University of British Columbia)
One of the oldest and most popular problem in combinatorial geometry is Erdos' unit distances problem; What is the largest number of unit distances determined by n points in the plane. The best known upper bound - which is still far from the conjectured value - is more than 30 years old. In this talk I will explain why is this problem so difficult and what are the possible ways to attack it.
Automatic MiSe System Software Version 1.4803M | admin login