Counting solutions to invariant equations in dense sets
Abstract
We prove a lower bound of exp(-C (log(2/alpha))7)Nk-1 to the number of solutions of an invariant equation in k variables, contained in a set of density alpha. Moreover, we give a Behrend-type construction for the same problem with the number of solutions of a convex equation bounded above by exp(-c (log(2/alpha))2)Nk-1. Furthermore, improving the result of Schoen and Sisask, we show that if a set does not contain any non-trivial solutions to an equation of length at least 2(3m+1)+2 for some positive integer m, then its size is at most exp(-c(log N)1/(6+gamma))N, where gamma = 21-m.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.