Improved bound in Roth's theorem on arithmetic progressions
From MaRDI portal
Publication:2039550
DOI10.1016/j.aim.2021.107801zbMath1492.11017arXiv2005.01145OpenAlexW3168636165MaRDI QIDQ2039550
Publication date: 5 July 2021
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.01145
Related Items
On the running time of hypergraph bootstrap percolation ⋮ A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
Cites Work
- Unnamed Item
- On certain other sets of integers
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On Roth's theorem on progressions
- Roth's theorem in the primes
- Roth's theorem on progressions revisited
- An improved construction of progression-free sets
- A polynomial bound in Freiman's theorem.
- On triples in arithmetic progression
- Roth's theorem in many variables
- Sets with large additive energy and symmetric sets
- Integer sets containing no arithmetic progressions
- ADDITIVE DIMENSION AND A THEOREM OF SANDERS
- ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS
- New bounds on cap sets
- On a theorem of Shkredov
- A Note on Elkin’s Improvement of Behrend’s Construction
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- On sets of large trigonometric sums
- On sumsets of dissociated sets
- Integer Sets Containing No Arithmetic Progressions
- On Sets of Natural Numbers Whose Difference Set Contains No Squares
- On sets of integers containing k elements in arithmetic progression
- ON IMPROVING ROTH'S THEOREM IN THE PRIMES
- Logarithmic bounds for Roth's theorem via almost-periodicity
- Improving Roth's Theorem in the Primes
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
This page was built for publication: Improved bound in Roth's theorem on arithmetic progressions
