Near optimal bounds for the Erdős distinct distances problem in high dimensions
- 157 Downloads
We show that the number of distinct distances in a set of n points in ℝd is Ω(n2/d − 2 / d(d + 2)), d ≥ 3. Erdős’ conjecture is Ω(n2/d).
Mathematics Subject Classification (2000)52C10
Unable to display preview. Download preview PDF.
- A. Iosevich: Szemerédi-Trotter incidence theorem, related results, and amusing consequences; in Proceedings of Minicorsi di Analisi Matematica, Padova (to appear).Google Scholar
- J. Solymosi and V. H. Vu: Distinct distances in high dimensional homogeneous sets, in Towards a Theory of Geometric Graphs (J. Pach, ed.), pp. 259–268, Contemporary Mathematics, vol. 342, Amer. Math. Soc., 2004.Google Scholar
© Springer-Verlag 2008