Skip to content

Erdős Problem #1194

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: additive combinatorics, additive basis, sidon sets.

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 #1194 is OPEN SHARP RATE in the source as of 15 October 2026.

An infinite perfect difference set \(A\subseteq\mathbb N\) uniquely represents every integer \(n\ge1\) as \(a_n-b_n\) for \(a_n,b_n\in A\); uniqueness refers to ordered positive differences. Such an \(A\) is Sidon, and \(a_n\) is the larger element of the unique pair representing \(n\), not the \(n\) th enumerated member of \(A\). Ask how fast \(a_n/n\) must increase. Bounds asserted infinitely often differ sharply from a bound for every sufficiently large \(n\).

A small example

The four-point ruler \(A=\{0,1,4,6\}\) has all six positive differences exactly once: differences \(1,2,3,4,5,6\). It also has distinct unordered two-term sums, so is a finite Sidon set. This exact fixture illustrates uniqueness; it is not an infinite perfect difference set. The zero element can be shifted to make all elements positive without changing differences.

What is known

The catalogue https://www.erdosproblems.com/1194 marks the sharp rate OPEN, referencing Erdős [Er80,p.100]. Greedy constructions, described by Lev [Le04], produce an infinite perfect difference set with \(a_n\ll n^3\). Erdős established \(\limsup a_n/n=\infty\) and the site derives \(a_n\gg n\log n\) infinitely often from thin subsequences of infinite Sidon sets [HaRo66]. Cilleruelo–Nathanson [CiNa08] transfer denser Sidon constructions. A 2026 GPT-5.4 Pro argument in comments, reported as \(a_n\gg n^{2-o(1)}\) infinitely often (and a parameterized divergent-series variant), is external and requires independent proof verification; it does not settle the optimal achievable rate.

GCL's current state

Authenticated original issue-bound research source return. The exact bounded example was independently replayed through ci/erdos_compendium_007_phase23_checks.py; general mathematical results here remain explicitly attributed to primary/external proofs, not independently certified by GCL. This manuscript is a local UNACCEPTED editorial draft.

What remains

Read Erdős 1980, Lev 2004 and CiNa08 for the representation indexing and existence constructions. Independently referee the 2026 lower argument, especially its quantifiers 'infinitely often', divergent-series hypothesis, and whether the coefficient is uniform over all perfect difference sets. Keep proven lower results separate from proposed stronger claims.

Any critical sample approval, theorem source fidelity, public site rollout and protected V2 admission are separate uncompleted steps.

Sources and claim boundaries

https://www.erdosproblems.com/1194 ; [Er80,p.100],[Le04],[CiNa08],[HaRo66], external 2026 comment proof pending.

Finite evidence: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE23.json. Frozen original source issue identity retained; independent mathematical source approval PENDING.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2465 — 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.

Back to catalogue · Compendium introduction