Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 11 Aug 2014 in math.CO and math.NT | (1408.2568v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.