On Roth's theorem on progressions
From MaRDI portal
Publication:640798
DOI10.4007/annals.2011.174.1.20zbMath1264.11004arXiv1011.0104WikidataQ55966507 ScholiaQ55966507MaRDI QIDQ640798
Publication date: 20 October 2011
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.0104
Fourier analysis; Roth's theorem; arithmetic progressions; Bohr sets; bourgainisation; Croot-Sisask; Katz-Koester; three-term progressions
Related Items
NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR, MATRIX PROGRESSIONS IN MULTIDIMENSIONAL SETS OF INTEGERS, ON IMPROVING ROTH'S THEOREM IN THE PRIMES, Covering the Large Spectrum and Generalized Riesz Products, An arithmetic transference proof of a relative Szemerédi theorem, On sets of integers which contain no three terms in geometric progression, Ramsey-type numbers involving graphs and hypergraphs with large girth, On the classification of Stanley sequences, Short proofs of some extremal results. II., On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs, Van der Waerden function and colorings of hypergraphs with large girth, Long arithmetic progressions in \(A+A+A\) with \(A\) a prime subset, The NOF multiparty communication complexity of composed functions, Enumerating solution-free sets in the integers, Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small, Arithmetic progressions, different regularity lemmas and removal lemmas, Novel structures in Stanley sequences, A new lower bound for van der Waerden numbers, Arithmetic progressions in multiplicative groups of finite fields, Maximal sets with no solution to \(x+y=3z\), Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching, A generalization of Roth's theorem in function fields, Higher moments of convolutions, Roth's theorem in many variables, An improved lower bound related to the Furstenberg-Sárközy theorem, Nil Bohr\(_0\)-sets and polynomial recurrence, On the growth of Stanley sequences, Some remarks on barycentric-sum problems over cyclic groups, Finite field models in arithmetic combinatorics -- ten years on, ADDITIVE DIMENSION AND A THEOREM OF SANDERS, ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS, A Prime Analogue of Roth’s Theorem in Function Fields, ARITHMETIC PROGRESSIONS IN SETS OF SMALL DOUBLING, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS, New bounds on cap sets, Some Properties of Lower Level-Sets of Convolutions, ON A DIAGONAL QUADRIC IN DENSE VARIABLES, On Systems of Complexity One in the Primes, Generalizations of Fourier analysis, and how to apply them, A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On certain other sets of integers
- Near optimal bounds in Freiman's theorem
- A probabilistic technique for finding almost-periods of convolutions
- 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 subsets of finite Abelian groups with no 3-term arithmetic progressions
- A linear bound on the dimension in Green-Ruzsa's theorem
- On triples in arithmetic progression
- Integer sets containing no arithmetic progressions
- ADDITIVE PROPERTIES OF MULTIPLICATIVE SUBGROUPS OF Fp
- A Note on Elkin’s Improvement of Behrend’s Construction
- On Additive Doubling and Energy
- Integer Sets Containing No Arithmetic Progressions
- 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
- The true complexity of a system of linear equations
- On the best constant in Marcinkiewicz-Zygmund inequality
