A polylogarithmic bound in the nonlinear Roth theorem

DOI10.1093/IMRN/RNAA261MaRDI QIDQ6336386arXivFDO

Authors Sarah Peluse, Sean M. Prendiville

Publication date 9 March 2020

Published in arXiv

Full work available at URL https://doi.org/10.1093/IMRN/RNAA261

Mathematics Subject Classification ID

Density, gaps, topology (11B05) Arithmetic progressions (11B25) Diophantine inequalities (11D75)

arXiv classification

math.COmath.NT

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

This page was built for publication: A polylogarithmic bound in the nonlinear Roth theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6336386)