An Explicit Removal Estimate for Reciprocal-Sum-Free Sets
Version 1 / Nov 21, 2026 / CC BY 4.0
Abstract
Let be the largest cardinality of a subset of containing no three distinct elements with . We give an explicit uniform removal estimate for finite-prime relaxations of this problem. Together with the smooth-number decomposition, the estimate yields and an effective description of by finite optimization problems. If is the limiting density obtained by retaining triples with smooth primitive coordinates over the primes at most , then for . The proof uses elementary prime estimates, a finite quadratic sieve, and a dyadic decomposition indexed by the larger primitive parameter. We also give rational enclosures of arbitrary prescribed width and an explicit modulus of convergence for . The finite-prime framework and the underlying sieve are due to the earlier density-limit argument. The emphasis here is the uniform quantitative estimate.
Provenance statement
References
- T. F. Bloom, Erdős problem 302 , https://www.erdosproblems.com/302, including the construction attributed to Stijn Cambie.link
- D. Della Pietra, A positive-density improvement for all-length unit-fraction-free sets , manuscript, July 30, 2026, version of July 30, 2026 (https://github.com/donalddellapietra/erdos-301-proof/blob/789c6f045dbc81da3811031247d186a7128dafce/paper/main.tex).link
- P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory , Monographies de L'Enseignement Mathématique, vol. 28, Université de Genève, Geneva, 1980, p. 37.
- E. H. Jiang, J. Zhang, J. Yu, J. Lu, Z. Zhang, M. Simon, et al., Continual Graph Memory and Community Infrastructure for AI-Assisted Mathematical Discovery , arXiv:2610.02945 (https://arxiv.org/abs/2610.02945), 2026. See also the companion manuscript Erdős Problem #302: A Consolidated Candidate Proof of the Density Limit , version of September 26, 2026 (https://github.com/uclanlp/continual-graph-memory/blob/23367c6568c344d9c4dbf59be3f39b39f5d54324/results/erdos_302.md), Sections 2--6 and Appendix B.arXiv
Version history
- v1 · 12 pagesSubmitted by Liam KruerManuscript accompanying Justin Sun Prize submission JSP-000254. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos302-jsp-submission/tree/1af724ea53a44310c5386062baa22849e6eddafdCurrentNov 20, 2026