English

Improved Bounds for 3-Progressions

Number Theory 2026-05-18 v3 Combinatorics

Abstract

We prove that if A{1,,N}A\subset \{1,\dots,N\} has no nontrivial three-term arithmetic progressions, then Aexp(clog(N)1/6loglog(N)1)N|A|\leq \exp(-c\log(N)^{1/6}\log\log(N)^{-1})N for some absolute constant c>0c>0. 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

R2 v1 2026-07-01T11:41:56.776Z