A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
From MaRDI portal
Abstract: We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if contains no non-trivial three-term arithmetic progressions then . By the same method we also improve the bounds in the analogous problem over and for the problem of finding long arithmetic progressions in a sumset.
Recommendations
- Improved bound in Roth's theorem on arithmetic progressions
- A new proof of Roth’s theorem on arithmetic progressions
- Roth's theorem on progressions revisited
- On Roth's theorem on progressions
- scientific article; zbMATH DE number 4085746
- On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
- On improving Roth's theorem in the primes
- Improving Roth's theorem in the primes
- scientific article; zbMATH DE number 2218584
- An improvement of an extension of a theorem of Erdős and Fuchs
Cites work
- A generalization of Roth's theorem in function fields
- A polynomial bound in Freiman's theorem.
- Additive combinatorics
- Additive structures in sumsets
- Arithmetic progressions in sumsets
- Arithmetic progressions in sumsets and \(L^p\)-almost-periodicity
- Integer sets containing no arithmetic progressions
- Integer Sets Containing No Arithmetic Progressions
- New bounds on cap sets
- On certain other sets of integers
- On Certain Sets of Integers
- On Roth's theorem on progressions
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On sets of large trigonometric sums
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- On sumsets of dissociated sets
- On triples in arithmetic progression
- Roth's theorem on progressions revisited
- Translation invariant equations and the method of Sanders
Cited in
(66)- Additive combinatorics and graph theory
- Nonlinear Roth type theorems in finite fields
- A new lower bound for van der Waerden numbers
- Threshold functions and Poisson convergence for systems of equations in random sets
- On the complexity of finding and counting solution-free sets of integers
- A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
- Improved bound in Roth's theorem on arithmetic progressions
- Shape of the asymptotic maximum sum-free sets in integer lattice grids
- The equidistant dimension of graphs
- Improved bounds for progression-free sets in C₈^n
- An improved lower bound related to the Furstenberg-Sárközy theorem
- On the missing log in upper tail estimates
- On the \(\ell_4:\ell_2\) ratio of functions with restricted Fourier support
- A short remark on the multiplicative energy of the spectrum
- On solution-free sets of integers
- Monochromatic Hilbert cubes and arithmetic progressions
- Finite field models in arithmetic combinatorics -- ten years on
- Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions
- On arithmetic progressions in A+B+C
- Solvingxz=y2in Certain Subsets of Finite Groups
- Arithmetic progressions in the graphs of slightly curved sequences
- Generalizations of Fourier analysis, and how to apply them
- Short proofs of some extremal results. II.
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
- Three-term arithmetic progressions and sumsets
- New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
- A new proof of Roth’s theorem on arithmetic progressions
- New applications of the polynomial method: the cap set conjecture and beyond
- An application of the sum-product phenomenon to sets avoiding several linear equations
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- Szemerédi's Theorem in the Primes
- Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
- The Green-Tao theorem: an exposition
- On sets with small sumset and \(m\)-sum-free sets in \(\mathbb{Z}/p\mathbb{Z}\)
- Large sets avoiding linear patterns
- On the structure of the spectrum of small sets
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Extremal problems in hypergraph colourings
- Quantitative structure of stable sets in finite abelian groups
- The Erdős-Moser sum-free set problem
- Bounds for sets with no polynomial progressions
- Local properties via color energy graphs and forbidden configurations
- Logarithmic bounds for Roth's theorem via almost-periodicity
- Finding linear patterns of complexity one
- Covering the large spectrum and generalized Riesz products
- Improving Roth's theorem in the primes
- On a problem of Gowers
- scientific article; zbMATH DE number 5219601 (Why is no real title available?)
- On sets of integers which contain no three terms in geometric progression
- Further bounds in the polynomial Szemerédi theorem over finite fields
- Improved bounds on sizes of generalized caps in \(AG(n,q)\)
- Ramsey-type numbers involving graphs and hypergraphs with large girth
- Tower-type bounds for Roth's theorem with popular differences
- Four‐term progression free sets with three‐term progressions in all large subsets
- Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes
- Roth-type theorem for quadratic system in Piatetski-Shapiro primes
- On Roth's theorem on progressions
- A step towards the \(3k - 4\) conjecture in \(\mathbb{Z}/p\mathbb{Z}\) and an application to \(m\)-sum-free sets
- Quantitative bounds in the nonlinear Roth theorem
- Improved bounds for five-term arithmetic progressions
- Arithmetic progressions at the journal of the LMS
- Arithmetic progressions and thickness properties in self-similar Cantor sets
- A Roth-type theorem with mixed powers
- Roth's theorem on progressions revisited
This page was built for publication: A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188349)
