2000 character limit reached
Logarithmic bounds for translation-invariant equations in squares
Published 16 Sep 2014 in math.CO and math.NT | (1409.4501v3)
Abstract: We show that the equation $\lambda_1 n_12 + ... + \lambda_s n_s2 = 0$ admits non-trivial solutions in any subset of $[N]$ of density $(\log N){-c_s}$, provided that $s \geq 7$ and the coefficients $\lambda_i$ sum to zero and satisfy certain sign conditions. This improves upon previous known density bounds of the form $(\log\log N){-c}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.