Erdős Problem #241
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: additive combinatorics, 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.
The question in plain language
A strong \(B_3\) set \(A\subseteq\{1,\ldots,N\}\) is a set for which the sum of any three elements determines their multiset uniquely. Repeated summands are allowed, so the triples \((a,a,b)\) and \((a,b,b)\) are distinct, while permutations are considered the same. Let \(f(N)\) be the maximum size of such a set. Erdős #241 asks whether
A claim merely establishing upper and lower bounds proportional to \(N^{1/3}\) would not settle the constant-one limit.
A small example
The set \(A=\{1,5\}\) is strong \(B_3\): its possible unordered triple sums are \(3,7,11,15\), all distinct. There is a useful exact link to cyclic arithmetic. For \(A\subseteq[1,N]\), two triple sums differ in absolute value by at most \(3N-3\). Hence reduction modulo \(M\ge3N-2\) preserves exactly whether triple sums collide. For \(N=5\), \(M=13\) preserves the four sums, while modulo \(12\) the sums 3 and 15 collide. This is a sharp uniform threshold, not an asymptotic result.
What is known
The Bose–Chowla constructions yield strong \(B_3\) sets of size at least \((1-o(1))N^{1/3}\). Ben Green (2001) established an upper bound with constant \((7/2)^{1/3}\).
The latter is no longer the best published constant. Ethan Patrick White, An optimal \(L^2\) autoconvolution inequality, Canadian Mathematical Bulletin 67 (2024), 108–121, provides the improved upper constant at most
A February 2026 Rechnitzer preprint reports tighter rigorous autoconvolution bounds, but its transfer into a published numerical upper constant needs exact hypothesis and endpoint verification. None of these bounds proves the limit equals one.
GCL's current state
Source audit #1510 documents the pinned formal statement, the improvement to Green's historical constant, the finite sharp cyclic/no-wrap lemma and a protected adjudication of smaller finite \(B_3\) facts. It also identifies an already-existing native mathematical successor, which this documentary article neither duplicates nor authorizes.
What remains
Proving the conjecture requires tightening the asymptotic upper constant all the way to one, or identifying a counterexample to that limit. Sharp finite modular transport and small-set enumerations aid verification but do not resolve the asymptotics as \(N\) grows.
Sources and claim boundaries
- Erdős Problems #241, history.
- Bose–Chowla (1962/63): classical constructive lower bounds.
- Green (2001): historical upper constant, superseded by the next source.
- White (2024), publisher primary text, Theorem 1.1 and Corollary 1.2.
- Rechnitzer (2026): author preprint; derived improvements are conditional on matching rigorous endpoints.
- GCL source audit #1510: semantic checks and protected predecessor boundaries, not new theorem certification.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1510 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: FIRST_RECONNAISSANCE_TRANCHE.
- 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.