Combinatorics · Oct 6, 2026
Erdős’s reciprocal-sum conjecture and quasipolynomial Szemerédi bounds
Proves Erdős's conjecture that every set of positive integers with divergent reciprocal sum contains arithmetic progressions of every finite length. Quantitatively, for each fixed k ≥ 3, every subset of with no nonconstant k-term progression has size at most , with positive constants depending only on k.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model