Improved Bounds for 3-Progressions
Number Theory
2026-05-18 v3 Combinatorics
Abstract
We prove that if has no nontrivial three-term arithmetic progressions, then for some absolute constant . To obtain this bound, we use an iterated variant of the sifting argument of Kelley and Meka, as well as an improved bootstrapping argument for Croot-Sisask almost-periodicity due to Bloom and Sisask.
Keywords
Cite
@article{arxiv.2603.27045,
title = {Improved Bounds for 3-Progressions},
author = {Rushil Raghavan},
journal= {arXiv preprint arXiv:2603.27045},
year = {2026}
}
Comments
24 pages. Comments welcome! Revised to fix a couple of typos