A polylogarithmic bound in the nonlinear Roth theorem

Published 9 Mar 2020 in math.NT and math.CO | (2003.04122v2)

Abstract: We show that sets of integers lacking the configuration $x$, $x+y$, $x+y^2$ have at most polylogarithmic density.

No one has generated a summary of this paper yet.

No one has generated a video about this paper yet.

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

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

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