Roth's theorem in many variables
From MaRDI portal
Publication:2017118
Abstract: We prove, in particular, that if a subset A of {1, 2,..., N} has no nontrivial solution to the equation x_1+x_2+x_3+x_4+x_5=5y then the cardinality of A is at most N e^{-c(log N)^{1/7-eps}}, where eps>0 is an arbitrary number, and c>0 is an absolute constant. In view of the well-known Behrend construction this estimate is close to best possible.
Recommendations
- Roth's theorem for four variables and additive structures in sums of sparse sets
- Behrend-type constructions for sets of linear equations
- A generalization of Roth's theorem in function fields
- Improved bound in Roth's theorem on arithmetic progressions
- On solution-free sets for simultaneous quadratic and linear equations
Cites work
- scientific article; zbMATH DE number 3169559 (Why is no real title available?)
- scientific article; zbMATH DE number 3059689 (Why is no real title available?)
- A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression
- A polynomial bound in Freiman's theorem.
- A probabilistic technique for finding almost-periods of convolutions
- Additive combinatorics
- An extension of Behrend's theorem
- Freiman's theorem in finite fields via extremal set theory
- Generalized arithmetical progressions and sumsets
- Integer Sets Containing No Arithmetic Progressions
- Integer sets containing no arithmetic progressions
- Near optimal bounds in Freiman's theorem
- Non-trivial solutions to a linear equation in integers
- On Certain Sets of Integers
- On Non-Averaging Sets of Integers
- On Roth's theorem on progressions
- 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 subsets of finite Abelian groups with no 3-term arithmetic progressions
- On the Bogolyubov-Ruzsa lemma
- On triples in arithmetic progression
- Roth's theorem in \(\mathbb Z^n_4\)
- Roth's theorem on progressions revisited
- Solving a linear equation in a set of integers I
- Structure in sets with logarithmic doubling
Cited in
(16)- Roth's theorem for four variables and additive structures in sums of sparse sets
- Translation invariant equations and the method of Sanders
- Finite field models in arithmetic combinatorics -- ten years on
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- A meshless interpolating Galerkin boundary node method for Stokes flows
- A generalization of Roth's theorem in function fields
- Some remarks on barycentric-sum problems over cyclic groups
- Improved bound in Roth's theorem on arithmetic progressions
- The Kelley-Meka bounds for sets free of three-term arithmetic progressions
- Solving equations in dense Sidon sets
- Roth-Waring-Goldbach
- Roth's theorems for sets of matrices
- Linear equations and sets of integers
- Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem
- New applications of the polynomial method: the cap set conjecture and beyond
- Roth-type theorem for quadratic system in Piatetski-Shapiro primes
This page was built for publication: Roth's theorem in many variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017118)
