On Roth's theorem on progressions

DOI10.4007/ANNALS.2011.174.1.20zbMATH Open1264.11004arXiv1011.0104OpenAlexW3100139723WikidataQ55966507 ScholiaQ55966507MaRDI QIDQ640798FDOQ640798

Tom Sanders

Publication date: 20 October 2011

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Abstract: We show that if A is a subset of {1,...,N} contains no non-trivial three-term arithmetic progressions then |A|=O(N/ log^{1-o(1)} N). The approach is somewhat different from that used in arXiv:1007.5444.

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

Recommendations

• Roth's theorem on progressions revisited
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• On triples in arithmetic progression
• Improved bound in Roth's theorem on arithmetic progressions
• On certain other sets of integers

zbMATH Keywords

arithmetic progressionsFourier analysisBohr setsRoth's theorembourgainisationCroot-SisaskKatz-Koesterthree-term progressions

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An improved construction of progression-free sets
• On Additive Doubling and Energy
• On triples in arithmetic progression
• 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
• The true complexity of a system of linear equations
• A polynomial bound in Freiman's theorem.
• On subsets of finite Abelian groups with no 3-term arithmetic progressions
• Integer sets containing no arithmetic progressions
• A Note on Elkin’s Improvement of Behrend’s Construction
• On certain other sets of integers
• Integer Sets Containing No Arithmetic Progressions
• Title not available (Why is that?)
• Roth's theorem on progressions revisited
• Title not available (Why is that?)
• Additive properties of multiplicative subgroups of \(\mathbb F_{p}\)
• A probabilistic technique for finding almost-periods of convolutions
• A linear bound on the dimension in Green-Ruzsa's theorem
• Near optimal bounds in Freiman's theorem
• On the best constant in Marcinkiewicz-Zygmund inequality

Cited In (73)

• Logarithmic bounds for Roth's theorem via almost-periodicity
• Roth's theorem in many variables
• Quantitative structure of stable sets in finite abelian groups
• MATRIX PROGRESSIONS IN MULTIDIMENSIONAL SETS OF INTEGERS
• The equidistant dimension of graphs
• Large sets avoiding linear patterns
• A new lower bound for van der Waerden numbers
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
• Caps and progression-free sets in \(\mathbb{Z}_m^n\)
• Long arithmetic progressions in \(A+A+A\) with \(A\) a prime subset
• Finite field models in arithmetic combinatorics -- ten years on
• Integer sets containing no arithmetic progressions
• Appendix to `Roth's theorem on progressions revisited' by J. Bourgain
• Some properties of lower level-sets of convolutions
• Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
• New bounds on cap sets
• NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR
• On the complexity of finding and counting solution-free sets of integers
• An improved lower bound related to the Furstenberg-Sárközy theorem
• Nil Bohr\(_0\)-sets and polynomial recurrence
• Ramsey-type numbers involving graphs and hypergraphs with large girth
• An application of the sum-product phenomenon to sets avoiding several linear equations
• ON IMPROVING ROTH'S THEOREM IN THE PRIMES
• Improved bound in Roth's theorem on arithmetic progressions
• New applications of the polynomial method: The cap set conjecture and beyond
• On sets of integers which contain no three terms in geometric progression
• Additive dimension and a theorem of Sanders
• Higher moments of convolutions
• A generalization of Roth's theorem in function fields
• On triples in arithmetic progression
• Arithmetic progressions, different regularity lemmas and removal lemmas
• Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions
• Ramsey-type numbers involving graphs and hypergraphs with large girth
• On the classification of Stanley sequences
• Short proofs of some extremal results. II.
• Title not available (Why is that?)
• Novel structures in Stanley sequences
• On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
• On a diagonal quadric in dense variables
• Title not available (Why is that?)
• Roth's theorem for four variables and additive structures in sums of sparse sets
• Arithmetic progressions in sets of small doubling
• A Roth-type theorem with mixed powers
• Arithmetic progressions in multiplicative groups of finite fields
• Some remarks on barycentric-sum problems over cyclic groups
• On Extending Rohlin's Theorem to Sequences
• Colourings of Uniform Hypergraphs with Large Girth and Applications
• The NOF multiparty communication complexity of composed functions
• A Prime Analogue of Roth’s Theorem in Function Fields
• Generalizations of Fourier analysis, and how to apply them
• Enumerating solution-free sets in the integers
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• Maximal sets with no solution to \(x+y=3z\)
• On Roth's theorem
• An arithmetic transference proof of a relative Szemerédi theorem
• Van der Waerden function and colorings of hypergraphs with large girth
• On the growth of Stanley sequences
• Mixing for progressions in nonabelian groups.
• Additive combinatorics and graph theory
• A short remark on the multiplicative energy of the spectrum
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
• On sets with small sumset and m-sum-free sets in Z/pZ
• Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes
• Title not available (Why is that?)
• Tower-type bounds for Roth's theorem with popular differences
• The Kelley-Meka bounds for sets free of three-term arithmetic progressions
• Covering the Large Spectrum and Generalized Riesz Products
• Roth-type theorem for quadratic system in Piatetski-Shapiro primes
• A step towards the \(3k - 4\) conjecture in \(\mathbb{Z}/p\mathbb{Z}\) and an application to \(m\)-sum-free sets
• On Systems of Complexity One in the Primes
• Improved bounds for five-term arithmetic progressions

This page was built for publication: On Roth's theorem on progressions

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