Skip to content

Erdős Problem #1085

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: geometry, distances.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

Place \(n\) distinct points anywhere in \(d\)‑dimensional space. How many pairs can be exactly one unit apart? Erdős Problem #1085 asks for the maximum possible count \(f_d(n)\).

There is no restriction that the other distances be at least one. That restriction belongs to the contact-number problem #1084, not to this problem.

A small example

Three vertices of an equilateral triangle of side one determine three unit-distance pairs. This is all \(\binom32=3\) possible pairs, so \(f_d(3)=3\) for every \(d\ge2\).

Four corners of a unit square determine four unit-distance sides and two diagonals of length \(\sqrt2\), yielding \(f_2(4)\ge4\). Showing that four is optimal would require a separate argument; the square alone supplies a lower bound.

What is known

The general extremal problem remains open. For the plane, the famous unit-distance upper bound is

\[ f_2(n)=O(n^{4/3}), \]

from Spencer, Szemerédi and Trotter (1984). The maintained catalogue reports a new superlinear planar lower result attributed to an internal model at OpenAI, for an infinite sequence of sizes. That unusually attributed claim has not been independently source-verified here and should not be treated as a GCL-certified theorem.

In dimension three, the catalogue records estimates between approximately \(n^{4/3}\log\log n\) and \(n^{3/2}\beta(n)\), with \(\beta\) slowly growing. For \(d\ge4\), orthogonal-circle constructions give quadratic leading terms governed by \(p=\lfloor d/2\rfloor\):

\[ f_d(n)=\frac{p-1}{2p}n^2+o(n^2) \]

in the regimes covered by the cited extremal results. Even dimensions have sharper established formulas; odd dimensions contain correction terms.

GCL's current state

Authenticated source audit #2356 compared the dimension-dependent statements and inspected the frozen formal-conjectures definition. That definition does not impose minimum separation, matching the essential difference from #1084.

Finite triangle and square examples have been checked. The full published incidence proofs, and especially the newer claimed lower result, have not undergone independent mathematical-source verification.

What remains

Verify the original 1984 upper theorem, the higher-dimensional Lenz–Erdős constructions and the primary proof for any proposed new planar lower bound. Separate dimension-specific resolved cases from the still-open planar and spatial growth questions.

Sources and claim boundaries

Erdős Problem #1085, status as of May 2026; Spencer–Szemerédi–Trotter (1984), reported upper theorem; frozen formal statement; authenticated source return #2356. All broad bounds are external; the new planar lower claim remains unverified. This manuscript is unaccepted.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2356 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction