Erdős Problem #1084
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
Suppose \(n\) points in \(d\) dimensions are separated by distances of at least one. What is the largest number of pairs exactly one unit apart?
This maximum, denoted \(f_d(n)\), is the contact number. Equivalently, place nonoverlapping congruent balls with centers at the points and count pairs that touch. Erdős Problem #1084 asks for contact-number estimates across dimensions.
The planar special case is a solved theorem, while the broad higher-dimensional problem remains open.
A small example
Place points in a hexagonal patch of the triangular lattice. In axial integer coordinates, take
Choose two Euclidean unit vectors at angle \(60^\circ\) as the coordinate basis. The squared distance between axial points is
For radius \(r\), this patch has \(N=3r^2+3r+1\) points and \(9r^2+3r\) pairs at unit distance. Exact enumeration for \(r=1,2,3,4\) gives respectively
| Points | Contact pairs |
|---|---|
| 7 | 12 |
| 19 | 42 |
| 37 | 90 |
| 61 | 156 |
These finite examples attain the published planar optimum at those sizes. They do not themselves prove optimality among all point configurations.
What is known
Harborth (1974) proved the exact planar contact formula for every \(n\ge2\):
The hexagonal cases above agree because \(12N-3=(6r+3)^2\). In dimension one, \(f_1(n)=n-1\) for \(n\ge1\).
In three dimensions, asymptotic contact estimates have a leading \(6n\) term, with boundary corrections of order \(n^{2/3}\). The maintained catalogue reports a Bezdek–Reid upper bound \(f_3(n)<6n-0.926n^{2/3}\). In higher dimensions, kissing-number bounds control the possible contacts per vertex, but do not determine the exact maximum.
GCL's current state
Authenticated source audit #2355 independently checks four triangular-lattice patches using integer geometry. This problem belongs to the required 20-article critical sample.
A genuine source-status discrepancy was found: the frozen Lean file marks its planar triangular-optimality theorem as research-open with an unproved body, even though Harborth's mathematical theorem is known. The parent's open classification can remain, but the planar annotation requires correction or explanation. No external Lean proof has been kernel-replayed.
What remains
Before the deterministic critical review can be closed, inspect Harborth's original 1974 proof and page-exact statement, review the geometric boundary argument establishing universal optimality, and reconcile the frozen formal-source annotation. Further investigate precise three-dimensional bounds without conflating them with the completed planar result.
Sources and claim boundaries
- Erdős Problem #1084, parent status and planar formula.
- Harborth (1974), original planar contact-number theorem, full primary proof audit pending.
- Bezdek–Reid (2013), three-dimensional contact-number estimates, primary review pending.
- Frozen formal source, annotated planar-status discrepancy.
- GCL source audit #2355, exact finite witnesses.
The critical review is pending, not falsely counted as completed. This is an unaccepted manuscript.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2355 — 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.