Erdős Problem #1221
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: analysis, distribution.
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
Imagine adding distinct points to a circle, one at a time. After \(n\) points have been placed, they divide the circumference into \(n\) positive gaps. An \(r\)‑span is the combined length of \(r\) successive gaps, counted cyclically. Let \(M_n^{(r)}\) and \(m_n^{(r)}\) be the longest and shortest such spans.
The 1949 problem of de Bruijn and Erdős asks whether every infinite sequence of distinct insertions must eventually exhibit increasingly pronounced imbalance when the number \(r\) of adjacent gaps considered grows. Define
The original conjecture asks whether
The factor \(r\) and the order of the infimum, limit superior, and supremum are essential. Other, related 1949 conjectures involve one-sided extremal quantities \(\Lambda_r\) and \(\lambda_r\).
A small example
Place five points temporarily at equal intervals, \(0,1/5,2/5,3/5,4/5\) around the unit circle. Every gap is \(1/5\). For \(r=2\), all five cyclic two-gap spans have length \(2/5\), so \(M_5^{(2)}/m_5^{(2)}=1\). This is a correct finite snapshot, not an infinite counterexample: one cannot infer anything about the limit superior from a single equally spaced stage.
A useful independent deduction needs no numerical simulation. If a theorem establishes, uniformly for every admissible infinite point sequence and all sufficiently large integers \(r\),
then taking the infimum over sequences gives \(\mu_r\ge 1+(\log r)/(100r)\). Therefore \(r(\mu_r-1)\ge (\log r)/100\), which diverges. This verifies the last logical step conditionally on the theorem, not its difficult proof.
What is known
De Bruijn and Erdős introduced the problem in Sequences of Points on a Circle (1949). Korsky's May 2026 preprint reports an improved fixed‑\(r\) bound \(1+r/(r^2-1)\) for \(r\ge2\); it alone does not establish divergence of \(r(\mu_r-1)\).
Korsky's September 2026 preprint, A Resolution of the de Bruijn--Erdős Consecutive-Gap Problem (arXiv:2609.07196), reports the stronger logarithmic lower bound displayed above. An updated version also asserts two one-sided \(\sqrt{\log r}\) discrepancy bounds corresponding to the other historical conjectures. The reported estimates would settle the ratio conjecture as stated, but this manuscript does not assert an independent proof-level verification of the preprint.
GCL's current state
The pinned catalogue still marks Problem #1221 open. The authenticated source-audit return flags a dated status conflict: the reported 2026 proof predates the pinned 2026-09-12 entry. The return identifies the sources and the conditional deduction, while explicitly withholding a full paper-version and proof audit.
No independent GCL mathematical proof certification, Lean replay, or updated protected status follows from that return. The live catalogue page could not be checked during the source audit.
What remains
Hash-lock the precise arXiv PDF/source version; compare its numbered theorems with each original 1949 conjecture; inspect the finite-prefix discrepancy argument and all quantifiers; resolve the pinned-versus-live catalogue status; and distinguish an externally announced resolution from GCL mathematical certification. Until then, the source-fidelity disposition is status conflict requiring further review.
Sources and claim boundaries
- De Bruijn and Erdős (1949), original paper.
- Korsky, May 2026 preliminary improvement.
- Korsky, September 2026 claimed resolution; the posted abstract asserts the quantitative ratio bound, but the present GCL review has not certified its proof.
- Original authenticated GCL source return, issue #2492.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2492 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_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.