A note on distinct distance subsets (Q2441415): Difference between revisions

The paper studies the following version of Erdős' distinct distances problem: what is the largest \(\delta(n)\), such that among any \(n\) points in the plane, there must be \(\delta(n)\) points, such that all \(\delta(n)\choose 2\) pairwise distances are distinct? The paper shows an \((n/\log n)^{1/3}\) lower bound for \(\delta(n)\) and conjectures that the truth is close to \(n^{1/2}\). Constructions showing an \(n^{1/2}\) upper bound exist on the plane, on the sphere, and on the hyperbolic plane; and the \((n/\log n)^{1/3}\) lower bound is also valid for the sphere and the hyperbolic plane.