The number of different distances determined by a set of points in the Euclidean plane
- First Online:
- 76 Downloads
In 1946 P. Erdös posed the problem of determining the minimum numberd(n) of different distances determined by a set ofn points in the Euclidean plane. Erdös provedd(n) ≥cn1/2 and conjectured thatd(n)≥cn/ √logn. If true, this inequality is best possible as is shown by the lattice points in the plane. We showd(n)≥n4/5/(logn)c.
Unable to display preview. Download preview PDF.