Balanced additive complements with bounded representation functions
Version 1 / Nov 21, 2026 / CC BY 4.0
Abstract
We construct infinite sets and of positive integers such that for every , every integer at least belongs to , and the number of ordered representations of any integer as with and is at most . In particular, , giving a negative answer to a conjecture of Erdős and Sárközy. The construction uses two nested prime-power scales, a uniform residue bound, and a local cardinality matching.
Provenance statement
References
- Erdős Problems, Problem 1145 , problem statement and discussion, accessed November 2026. https://www.erdosproblems.com/1145.link
- Plasma AI, Proof of the annular square-complement limits , public research notes, 2026. https://erdosproblems.ai/wiki/theory/additive_bases/L3_square_complement_nine_halves/_proof.link
- Plasma AI, Monotone path shells for Erdős Problem 1145 , public research notes, 2026. https://github.com/plasma-ai/erdos/blob/main/wiki/research/erdos_1145/monotone_path_shells.md.link
- Various authors, Some of Paul's favorite problems , booklet circulated at the conference ``Paul Erdős and his mathematics,'' Budapest, July 1999, Problem 1.17. https://web.math.pmf.unizg.hr/~vjekovac/EP/Some_of_Pauls_favorite_problems.pdf.link
Version history
- v1 · 7 pagesSubmitted by Liam KruerManuscript accompanying Justin Sun Prize submission JSP-000950. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos-1145/tree/9caddccde51364623c3c985c9fddd0b52a023e6bCurrentNov 20, 2026