Recurring differences from overlapping arithmetic progressions

Primarily AI-generated textHuman understanding: no partsmath.NT — Number Theory

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer ↗

Version 1 / Nov 21, 2026 / CC BY 4.0

Abstract

We give sufficient conditions for the signed differences occurring infinitely often in a set of natural numbers to have bounded gaps. The hypotheses use pairs of finite arithmetic progressions with coprime step quotients, positive normalized overlap, and bounded mutual distance. Bounded perturbations of the progressions are allowed. A finite circular-gap criterion gives the explicit bound 2gH+4C2gH+4C, including equality at the overlap threshold. Exact centered pairs yield a finite-intersection theorem. Separated constructions realize these conditions at zero upper Banach density and give examples with no recurrent three-point pattern, no infinite arithmetic progression of recurrent differences, and infinitely many pairwise almost disjoint translates. Further examples describe the rational limiting threshold and the order of the quantitative gap bound.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000276. Pinned source and Lean verification materials: https://github.com/Ghuffy1/erdos-332/tree/cf1e6ab6401ce288dcb4194fdfe314c2edb2fc84

Provenance statement

AI assistance is disclosed in the manuscript. The linked repository supplies the original-statement bridges, Lean axiom audit and fresh kernel replay.

References

  1. P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory , Monographies de L'Enseignement Mathématique, no. 28, Université de Genève, Geneva, 1980.
  2. I. Goldbring and S. Leth, On supra-SIM sets of natural numbers , arXiv:1805.05933 (https://arxiv.org/abs/1805.05933), 2018.arXiv
  3. S. Leth, Some nonstandard methods in combinatorial number theory , Studia Logica 47 (1988), no. 3, 265--278. doi:10.1007/BF00370556 (https://doi.org/10.1007/BF00370556).DOI
  4. I. Z. Ruzsa, On difference sets , Studia Scientiarum Mathematicarum Hungarica 13 (1978), 319--326.
  5. C. L. Stewart and R. Tijdeman, On infinite-difference sets , Canadian Journal of Mathematics 31 (1979), no. 5, 897--910. doi:10.4153/CJM-1979-085-6 (https://doi.org/10.4153/CJM-1979-085-6).DOI
  6. Erdős Problem a Day, Erdős problem #332: live audit and a sharp upper-Banach-density boundary , working report, 28 July 2026, Sections 3--4. erdosproblemaday.com/report/332 (https://www.erdosproblemaday.com/report/332).link
  7. jeremy-math-332-worker, Fixed-template discussion for Erdős #332 , Botnet, 29 September 2026. botnet.com, Erdős #332 discussion (https://botnet.com/topics/af009ddc-ed6e-43c1-9bce-a76d1ed84aa0).link
  8. Plasma AI, Recurrent difference sets , research note, accessed 11 November 2026. erdosproblems.ai, Recurrent difference sets (https://erdosproblems.ai/wiki/research/recurrent_difference_sets).link

Version history

  1. v1 · 10 pagesSubmitted by Liam KruerManuscript accompanying Justin Sun Prize submission JSP-000276. Pinned source and Lean verification materials: https://github.com/Ghuffy1/erdos-332/tree/cf1e6ab6401ce288dcb4194fdfe314c2edb2fc84CurrentNov 21, 2026