Exact Growth of the Planar Unit-Distance Function
Canonical statement
View source LaTeX
For \(n\geq2\), set
\[
u(n)=\max_{\substack{P\subset\mathbb R^2\\|P|=n}}
\bigl|\{\,\{x,y\}\subset P:\|x-y\|_2=1\,\}\bigr|
\]
and
\[
\alpha_U=\limsup_{n\to\infty}\frac{\log u(n)}{\log n}.
\]
Determine the exact value of \(\alpha_U\) (and, more finely, the
asymptotic order of \(u(n)\)).Notes
This problem asks for the maximal number of unit-distance pairs among points in the plane — a question going back to Erdős in 1946 — and specifically for the growth exponent . Sections of a suitably scaled integer lattice show that grows slightly faster than linearly, and Erdős long conjectured that near-linear growth of the form is the truth.
On the upper side, the incidence bound of Spencer, Szemerédi, and Trotter gives , hence [SpencerSzemerediTrotter1984Unit]. In May 2026 the near-linear conjecture was disproved: an externally checked construction, found with the assistance of an AI model, produces an absolute and infinitely many with [OpenAI2026UnitDistance] [SawinEtAl2026UnitDistance].
What survives is the exact-growth problem: is now pinned between and , and determining its exact value — and the finer asymptotic order of — remains open.
References (3)
- [SpencerSzemerediTrotter1984Unit]
Unit distances in the Euclidean plane
Joel Spencer and Endre Szemerédi and William T. Trotter · 1984 · misc
- [OpenAI2026UnitDistance]
A model disproves a long-standing conjecture in discrete geometry
Open ↗OpenAI · 2026 · misc
- [SawinEtAl2026UnitDistance]
Superlinear many unit distances in the plane
Open ↗Will Sawin and others · 2026 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.