Erdős Problem #1083
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
Arrange \(n\) distinct points in \(d\)‑dimensional Euclidean space. How few different positive distances can occur between pairs?
Write \(f_d(n)\) for the minimum number among all such configurations. Erdős Problem #1083 asks, for each fixed \(d\ge3\), whether the correct order is
This differs from nearby Problem #1084, which counts the maximum number of contacts after forbidding distances below one.
A small example
Choose a \(q\times q\times q\) grid in three dimensions. Its \(n=q^3\) points have integer squared distances between \(1\) and \(3(q-1)^2\). Therefore at most \(3(q-1)^2\) distinct positive distances can occur.
For \(q=2\), eight cube corners yield precisely three squared-distance types \(\{1,2,3\}\). For \(q=3\), the 27 points yield precisely nine types
More generally, a \(d\)‑dimensional \(q\)‑grid has \(q^d\) points and at most \(d(q-1)^2\) distinct distances. It provides the familiar upper construction of order \(n^{2/d}\), not a matching lower bound.
What is known
The conjectural sharp exponent remains open. Erdős established the elementary bounds of order between \(n^{1/d}\) and \(n^{2/d}\). The maintained catalogue credits Solymosi and Vu (2008) with a \(3\)‑dimensional lower bound proportional to \(n^{3/5}\) and, for \(d\ge4\), a lower exponent of the form \(2/d-c/d^2\).
The catalogue also explains a strengthening of the three-dimensional statement obtained by combining the method with the planar Guth–Katz distinct-distances theorem. The precise theorem hypotheses and dependence on fixed \(d\) need primary-paper review.
GCL's current state
Authenticated source audit #2354 verified the exact grid counts and the published-bound synopsis. The live catalogue says a formalized statement exists, but the frozen formal-conjectures commit used by GCL does not contain a #1083 file. That is a versioned formal-source refresh obligation, not proof that no formalization exists.
What remains
Obtain the original Erdős and Solymosi–Vu papers, audit the precise exponents and their dependencies, and reconcile the current formal statement against the protected pinned snapshot. The main mathematical question remains obtaining the conjectural exponent for all fixed dimensions.
Sources and claim boundaries
Erdős Problem #1083; Erdős (1946), original distinct-distance bounds; Solymosi–Vu (2008), higher-dimensional lower bounds; GCL source return #2354. The finite grid calculations are independent; the general conjecture is open. This article is unaccepted.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2354 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: FORMAL_SOURCE_REFRESH_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.