← All problems

Erdős Problem #1085 — Unit distances in Euclidean space

51 years old · traced to

For positive integers dd and nn, and a finite set P⊂RdP\subset\mathbb{R}^d, let u(P)u(P) denote the number of unordered pairs of distinct points of PP at Euclidean distance 11. The function in the question is the extremal quantity

fd(n)=max⁡P⊂Rd∣P∣=nu(P)=max⁡P⊂Rd∣P∣=n#{{x,y}⊂P:∣x−y∣=1}.f_d(n)=\max_{\substack{P\subset\mathbb{R}^d\\|P|=n}}u(P) =\max_{\substack{P\subset\mathbb{R}^d\\|P|=n}}\#\bigl\{\{x,y\}\subset P:|x-y|=1\bigr\}.

Estimate its growth as nn increases, for fixed dimension dd; in particular, determine or sharpen the bounds on fd(n)f_d(n) 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 O(n4/3)O(n^{4/3}) 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

Progress summary

Never refreshed

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.