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: Thursday, May 27, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Pavel Valtr (Charles Univ., Prague)

Strictly convex norms allowing many unit distances

We construct a (simply defined) strictly convex norm ||.|| in the plane such that for each n there is a set of n points determining Ω(n4/3) unit distances with respect to ||.||. This gives another evidence that a new proof technique will be needed to improve the currently best known upper bound O(n4/3) for Erdös' unit-distance problem in the euclidean plane. Our result is asymptotically best possible and disproves a conjecture of Brass. An analogous construction in R3 gives an almost tight lower bound Ω(n3/2). A connection to lattice problems and to geometric touching problems is also given.

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