arXiv Analytics

Sign in

arXiv:1408.2568 [math.CO]AbstractReferencesReviewsResources

Roth's theorem for four variables and additive structures in sums of sparse sets

Tomasz Schoen, Olof Sisask

Published 2014-08-11Version 1

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's construction, this bound is of the right shape: the exponent 1/7 cannot be replaced by any constant larger than 1/2. We also establish a related result, which says that sumsets A+A+A contain long arithmetic progressions if A is a subset of {1,...,N}, or high-dimensional subspaces if A is a subset of a vector space over a finite field, even if A has density of the shape above.

Related articles: Most relevant | Search more
arXiv:1810.12791 [math.CO] (Published 2018-10-30)
Logarithmic bounds for Roth's theorem via almost-periodicity
arXiv:0801.2577 [math.CO] (Published 2008-01-16, updated 2008-04-01)
A new proof of Roth's theorem on arithmetic progressions
arXiv:2004.13690 [math.CO] (Published 2020-04-28)
Tower-type bounds for Roth's theorem with popular differences