arXiv · 2003.04122
A polylogarithmic bound in the nonlinear Roth theorem
Abstract
We show that sets of integers lacking the configuration $x$, $x+y$, $x+y^2$ have at most polylogarithmic density.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sarah Peluse, Sean Prendiville. 2021-09-14. A polylogarithmic bound in the nonlinear Roth theorem. https://arxiv.org/abs/2003.04122
Cite the original work for its findings. Save a collection to share your selection of sources.