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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4177149 (Why is no real title available?)
- scientific article; zbMATH DE number 3071148 (Why is no real title available?)
- A linear bound on the dimension in Green-Ruzsa's theorem
- A note on Elkin's improvement of Behrend's construction
- A polynomial bound in Freiman's theorem.
- A probabilistic technique for finding almost-periods of convolutions
- Additive combinatorics
- Additive properties of multiplicative subgroups of \(\mathbb F_{p}\)
- Integer Sets Containing No Arithmetic Progressions
- Integer sets containing no arithmetic progressions
- Near optimal bounds in Freiman's theorem
- 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
- On additive doubling and energy
- On certain other sets of integers
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- On the best constant in Marcinkiewicz-Zygmund inequality
- On triples in arithmetic progression
- Roth's theorem in the primes
- Roth's theorem on progressions revisited
- The true complexity of a system of linear equations
Cited in
(74)- Improved bounds for five-term arithmetic progressions
- Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes
- A step towards the \(3k - 4\) conjecture in \(\mathbb{Z}/p\mathbb{Z}\) and an application to \(m\)-sum-free sets
- The Kelley-Meka bounds for sets free of three-term arithmetic progressions
- Covering the large spectrum and generalized Riesz products
- scientific article; zbMATH DE number 7733110 (Why is no real title available?)
- On systems of complexity one in the primes
- Tower-type bounds for Roth's theorem with popular differences
- On sets with small sumset and \(m\)-sum-free sets in \(\mathbb{Z}/p\mathbb{Z}\)
- Roth-type theorem for quadratic system in Piatetski-Shapiro primes
- Roth's theorem for four variables and additive structures in sums of sparse sets
- An improved lower bound related to the Furstenberg-Sárközy theorem
- A new lower bound for van der Waerden numbers
- Ramsey-type numbers involving graphs and hypergraphs with large girth
- Appendix to `Roth's theorem on progressions revisited' by J. Bourgain
- The NOF multiparty communication complexity of composed functions
- Finite field models in arithmetic combinatorics -- ten years on
- Higher moments of convolutions
- scientific article; zbMATH DE number 3906649 (Why is no real title available?)
- The equidistant dimension of graphs
- Caps and progression-free sets in \(\mathbb{Z}_m^n\)
- New bounds on cap sets
- An application of the sum-product phenomenon to sets avoiding several linear equations
- A Roth-type theorem with mixed powers
- Arithmetic progressions in multiplicative groups of finite fields
- Some properties of lower level-sets of convolutions
- On Roth's theorem
- Logarithmic bounds for Roth's theorem via almost-periodicity
- Long arithmetic progressions in \(A+A+A\) with \(A\) a prime subset
- A prime analogue of Roth's theorem in function fields
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- A generalization of Roth's theorem in function fields
- On triples in arithmetic progression
- An arithmetic transference proof of a relative Szemerédi theorem
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Roth's theorem in many variables
- Some remarks on barycentric-sum problems over cyclic groups
- Improved bound in Roth's theorem on arithmetic progressions
- Arithmetic progressions in sets of small doubling
- Additive combinatorics and graph theory
- Arithmetic progressions, different regularity lemmas and removal lemmas
- Quantitative structure of stable sets in finite abelian groups
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On Extending Rohlin's Theorem to Sequences
- Van der Waerden function and colorings of hypergraphs with large girth
- Matrix progressions in multidimensional sets of integers
- Novel structures in Stanley sequences
- Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions
- Mixing for progressions in nonabelian groups.
- Integer sets containing no arithmetic progressions
- Colourings of uniform hypergraphs with large girth and applications
- On improving Roth's theorem in the primes
- On sets of integers which contain no three terms in geometric progression
- Roth's theorem on progressions revisited
- A short remark on the multiplicative energy of the spectrum
- Additive dimension and a theorem of Sanders
- A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
- Large sets avoiding linear patterns
- Ramsey-type numbers involving graphs and hypergraphs with large girth
- On the classification of Stanley sequences
- Short proofs of some extremal results. II.
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
- scientific article; zbMATH DE number 5528961 (Why is no real title available?)
- On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
- Enumerating solution-free sets in the integers
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Nil Bohr\(_0\)-sets and polynomial recurrence
- Generalizations of Fourier analysis, and how to apply them
- On the growth of Stanley sequences
- On the complexity of finding and counting solution-free sets of integers
- Maximal sets with no solution to \(x+y=3z\)
- New applications of the polynomial method: the cap set conjecture and beyond
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- On a diagonal quadric in dense variables
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)
