Papers
Topics
Authors
Recent
Search
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}$.

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 (1)

Collections

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