Improved Bounds for 3-Progressions

Abstract

We prove that if A⊂ \1,…,N\ has no nontrivial three-term arithmetic progressions, then |A|≤ (-c(N)1/6(N)-1)N for some absolute constant c>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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…