Roth's theorem in many variables
From MaRDI portal
Publication:2017118
DOI10.1007/S11856-013-0049-0zbMATH Open1370.11023arXiv1106.1601OpenAlexW2037992515MaRDI QIDQ2017118FDOQ2017118
Authors: Tomasz Schoen, Ilya D. Shkredov 
Publication date: 25 June 2014
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1106.1601
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
- Additive combinatorics
- An improved construction of progression-free sets
- On triples in arithmetic progression
- 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
- Solving a linear equation in a set of integers I
- On Roth's theorem on progressions
- 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
- Integer Sets Containing No Arithmetic Progressions
- Roth's theorem on progressions revisited
- Freiman's theorem in finite fields via extremal set theory
- Generalized arithmetical progressions and sumsets
- Non-trivial solutions to a linear equation in integers
- A probabilistic technique for finding almost-periods of convolutions
- Roth's theorem in \(\mathbb Z^n_4\)
- Near optimal bounds in Freiman's theorem
- A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Bogolyubov-Ruzsa lemma
- An extension of Behrend's theorem
- On Non-Averaging Sets of Integers
- Structure in sets with logarithmic doubling
Cited In (14)
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Finite field models in arithmetic combinatorics -- ten years on
- Roth's theorems for sets of matrices
- Improved bound in Roth's theorem on arithmetic progressions
- The Kelley-Meka bounds for sets free of three-term arithmetic progressions
- New applications of the polynomial method: The cap set conjecture and beyond
- Translation invariant equations and the method of Sanders
- A generalization of Roth's theorem in function fields
- Roth-type theorem for quadratic system in Piatetski-Shapiro primes
- Roth's theorem for four variables and additive structures in sums of sparse sets
- Some remarks on barycentric-sum problems over cyclic groups
- A meshless interpolating Galerkin boundary node method for Stokes flows
- Linear equations and sets of integers
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)
