Erdős Problem #1213
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: proved (not automatically the live result).
Subject areas: additive combinatorics.
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
Erdős Problem #1213 currently has source status PROVED — HEGYVÁRI.
Let \(1\le a=a_1<\cdots<a_s\) have gaps \(a_{i+1}-a_i\le K\), and let \(I,J\) be distinct contiguous intervals of sequence indices, not arbitrary subsets or numerical intervals of the real line. Ask whether a function \(f(a,K)\) exists such that \(a_s>f(a,K)\) guarantees equal interval sums \(\sum_{i\in I}a_i=\sum_{j\in J}a_j\). The intervals need not be disjoint according to the printed question, although explicit disjoint witnesses are stronger.
A small example
For the sequence \((2,3,4,5)\), with \(a=2,K=1\), the first two terms sum to \(2+3=5\), equal to the final singleton term \(5\). Those index intervals \([1,2]\) and \([4,4]\) are disjoint and distinct. The phase25 check enumerates all nonempty contiguous intervals. This one example is not a proof of Hegyvári's general \(a e^{O(K)}\) upper bound.
What is known
The maintained https://www.erdosproblems.com/1213 reports PROVED by Hegyvári [He86], with a quantitative bound \(f(a,K)\ll a\exp(O(K))\). Hegyvári suggested exponential dependence on the maximum gap \(K\) is likely not optimal. This is a statement about the last term exceeding a threshold, not merely having many terms without a bound on gaps. The primary proof and exact constants have not been independently replayed by GCL.
GCL's current state
Authenticated original-issue research return. The finite example was independently replayed with ci/erdos_compendium_007_phase25_checks.py; the source-attributed theorem and any general set-theoretic conclusions are NOT independently certified. This manuscript is a LOCAL UNACCEPTED EDITORIAL DRAFT.
What remains
Read He86, check whether the original proof requires positive integer terms and the exact meaning of two intervals, and reconstruct the equal-sum collision argument with a source-verified explicit bound in \(a,K\). Independently check bounded sequences and search whether polynomial \(K\) dependence is plausible.
Mathematical source fidelity, any independent critical review, protected V2 editorial admission and live public deployment are distinct unfinished gates.
Sources and claim boundaries
https://www.erdosproblems.com/1213 ; [He86].
Finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE25.json. Original issue SHA/identity frozen and checked.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2484 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.