Strong Bounds for 3-Progressions

MaRDI QIDQ6508783arXivFDO

Authors Zander Kelley, Raghu Meka

Published in arXiv

Abstract: We show that for some constant $$, any subset $A$ of integers $1,ldots,N$ of size at least $$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic progressions were known to exist only for sets of size at least $N/(logN{)}^{1+c}$ for a constant $c>0$. Our approach is first to develop new analytic techniques for addressing some related questions in the finite-field setting and then to apply some analogous variants of these same techniques, suitably adapted for the more complicated setting of integers.

This page was built for publication: Strong Bounds for 3-Progressions

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