frontiers / frontier
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Reviewable change
back to reviewErdős Problem #44 remains OPEN. Statement: **Erdős Problem 44:** Let N ≥ 1 and `A ⊆ {1,…,N}` be a Sidon set. Is it true that, for any ε > 0, there exist M = M(ε) and `B ⊆ {N+1,…,M}` such that `A ∪ B ⊆ {1,…,M}` is a Sidon set of size at least `(1−ε)M^{1/2}`? This problem asks whether any Sidon set can be extended to achieve a density arbitrarily close to the optimal density for Sidon sets. Topics: number theory, sidon sets, additive combinatorics. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
A proposal; no authority until an accepted review event.
accept gate
0 of 4 on recordtimeline
vpr_a336726922e97c6fSEMANTIC-EDGE DRAFT -> Erdos #30 (vf_04c2ff267458866e) [specializes, confidence 0.85]: Problem 44 asserts the explicit upper bound (max Sidon set in {1,...,N} is at most 2√N), which is a specific quantitative bound on exactly the function h(N) that Problem 30 studies. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.proposed
reason
SEMANTIC-EDGE DRAFT -> Erdos #30 (vf_04c2ff267458866e) [specializes, confidence 0.85]: Problem 44 asserts the explicit upper bound (max Sidon set in {1,...,N} is at most 2√N), which is a specific quantitative bound on exactly the function h(N) that Problem 30 studies. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.
provenance
proposed by
agent:semantic-edge-extractor
actor type
human
created at
2026-06-10
target type
finding
affected
inspect finding →Erdős Problem #44 remains OPEN. Statement: **Erdős Problem 44:** Let N ≥ 1 and `A ⊆ {1,…,N}` be a Sidon set. Is it true that, for any ε > 0, there exist M = M(ε) and `B ⊆ {N+1,…,M}` such that `A ∪ B ⊆ {1,…,M}` is a Sidon set of size at least `(1−ε)M^{1/2}`? This problem asks whether any Sidon set can be extended to achieve a density arbitrarily close to the optimal density for Sidon sets. Topics: number theory, sidon sets, additive combinatorics. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
vf_a357c9d8ac3d6b26Read-only frontier; diff not recomputed.
Erdős problems frontier receives a reviewable source, finding, caveat, replication, evaluation, or proof-affecting edit.
The packet names affected record objects, evidence, rationale, reviewer-facing fields, and expected proof impact.
Schema, provenance, benchmark, contradiction, and proof checks decide whether the request is ready to read.
A steward accepts, rejects, caveats, revises, or retracts the request under an inspectable identity.
Only the accepted event mutates frontier state. Atlases, constellations, and search update from that record state.
Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.