Erdős Problem #1085 — Unit distances in Euclidean space
For positive integers and , and a finite set , let denote the number of unordered pairs of distinct points of at Euclidean distance . The function in the question is the extremal quantity
Estimate its growth as increases, for fixed dimension ; in particular, determine or sharpen the bounds on in the different dimension ranges. Erdős Problems #1085
Background
The question is the unit-distance case of Erdős’s broader problem of maximizing how often one distance can occur among a finite point set. In the plane, counting unit distances can be recast as counting incidences between the points and unit circles centered at those points. This connects the problem to incidence geometry: the classical point-line incidence bound has the same scale, and methods that apply equally to point-line incidences cannot by themselves improve that scale for unit distances. Pach, Raz, and Solymosi (2026)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.