A periodic-summand characterization for Erdős problem 335
Version 1 / Nov 21, 2026 / CC BY 4.0
Abstract
We characterize pairs of positive-density subsets of the positive integers for which the ordinary density of their sumset equals the sum of their densities. The modular boundary is controlled by literal residue supports. Above that boundary, the classification consists of parallel Bohr intervals with finite backgrounds, two periodic templates with a literal fringe test, or one sparse exceptional section with an exact terminal condition. This overview states the characterization and explains the proof structure. The linked development gives the detailed mathematical arguments and verifies the complete result in Lean using the original positive-integer counts.
Provenance statement
References
- P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory , 1980, pp. 50--51.
- M. Kneser, Abschätzung der asymptotischen Dichte von Summenmengen, Mathematische Zeitschrift 58 (1953), 459--484.
- E. Ackelsberg and F. K. Richter, An inverse theorem for sumsets of sets of positive density in the integers, arXiv:2604.12864 (https://arxiv.org/abs/2604.12864), 2026.arXiv
- J. T. Griesmer, Compact and Loeb inverse-theorem inputs, arXiv:1112.6403 (https://arxiv.org/abs/1112.6403) and arXiv:1807.01694 (https://arxiv.org/abs/1807.01694). The mathematical source notes identify the exact propositions.arXiv
Version history
- v1 · 4 pagesSubmitted by Liam KruerTeX edition of the four-page overview accompanying Justin Sun Prize submission JSP-000278. Pinned overview, detailed mathematical notes, and Lean verification: https://github.com/Ghuffy1/erdos-335/tree/29e64ce67b4999f76657bb4b51e306076f59e689CurrentNov 21, 2026