The Kelley-Meka bounds for sets free of three-term arithmetic progressions
From MaRDI portal
Publication:6179071
DOI10.2140/ent.2023.2.15arXiv2302.07211MaRDI QIDQ6179071
Publication date: 16 January 2024
Published in: Essential Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.07211
Cites Work
- On certain other sets of integers
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- A probabilistic technique for finding almost-periods of convolutions
- On Roth's theorem on progressions
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- An improved construction of progression-free sets
- Higher moments of convolutions
- On the Bogolyubov-Ruzsa lemma
- On triples in arithmetic progression
- Roth's theorem in many variables
- New bounds in Balog-Szemerédi-Gowers theorem
- ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS
- New bounds on cap sets
- Popular difference sets
- Some new results on higher energies
- A Note on Elkin’s Improvement of Behrend’s Construction
- Additive structures in sumsets
- Integer Sum Sets Containing Long Arithmetic Progressions
- The structure theory of set addition revisited
- Logarithmic bounds for Roth's theorem via almost-periodicity
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
This page was built for publication: The Kelley-Meka bounds for sets free of three-term arithmetic progressions
