The Kelley-Meka bounds for sets free of three-term arithmetic progressions

DOI10.2140/ENT.2023.2.15arXiv2302.07211MaRDI QIDQ6179071FDOQ6179071

Authors: Thomas F. Bloom, Olof Sisask 

Publication date: 16 January 2024

Published in: Essential Number Theory (Search for Journal in Brave)

Abstract: We give a self-contained exposition of the recent remarkable result of Kelley and Meka: if $Asubseteq1,ldots,N$ has no non-trivial three-term arithmetic progressions then $lvertAvertleqexp(-c(logN{)}^{1/11})N$ for some constant $c>0$. Although our proof is identical to that of Kelley and Meka in all of the main ideas, we also incorporate some minor simplifications relating to Bohr sets. This eases some of the technical difficulties tackled by Kelley and Meka and widens the scope of their method. As a consequence, we improve the lower bounds for finding long arithmetic progressions in $A+A+A$, where $Asubseteq1,ldots,N$.

Full work available at URL: https://arxiv.org/abs/2302.07211

Recommendations

• Exposé Bourbaki 1196 : Recent progress on bounds for sets with no three terms in arithmetic progression (after Bloom and Sisask, Croot, Lev, and Pach, and Ellenberg and Gijswijt)
• Sets of integers that do not contain long arithmetic progressions
• Improved bound in Roth's theorem on arithmetic progressions
• Arithmetical progressions and the number of sums

zbMATH Keywords

arithmetic progressionsadditive combinatorics

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• Higher moments of convolutions
• On triples in arithmetic progression
• Additive structures in sumsets
• Some new results on higher energies
• On Certain Sets of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On Roth's theorem on progressions
• New bounds in Balog-Szemerédi-Gowers theorem
• The structure theory of set addition revisited
• New bounds on cap sets
• A note on Elkin's improvement of Behrend's construction
• On certain other sets of integers
• Integer Sum Sets Containing Long Arithmetic Progressions
• A probabilistic technique for finding almost-periods of convolutions
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• Popular difference sets
• On the Bogolyubov-Ruzsa lemma
• Roth's theorem in many variables
• Logarithmic bounds for Roth's theorem via almost-periodicity
• Roth's theorem for four variables and additive structures in sums of sparse sets

This page was built for publication: The Kelley-Meka bounds for sets free of three-term arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179071)