Extensions of the Furstenberg-Sárközy theorem via the arithmetic level-$d$ inequality

Abstract

Green and Sawhney recently obtained a quasipolynomial bound in the Furstenberg--Sárközy theorem for square differences by proving an ``arithmetic level-d'' inequality, thereby yielding a greatly improved density increment scheme. We apply their method to treat general intersective polynomials $h\in \mathbb{Z}[x]$. In particular, let \[ D(h(\mathbb{N}),X):= \max{|A|:\ A\subseteq [1,X]\cap\mathbb{N} \text{and}\ (A-A)\cap h(\mathbb{N})\subseteq\{0\}}. \] We prove that for every $0<\mu <1/2$ there are constants $c_0,X_{\text{min}}>0$ depending on $h$ and $\mu$ such that for every $X>X_{\text{min}}$, \[D(h(\mathbb{N}), X)\leq Xe^{-c_0(\log X)^μ}.\] This is the best quantitative upper bound presently known for sets lacking intersective polynomial differences, improving upon the work of Arala. In order to achieve the admissible exponent range $0<\mu <1/2$, we use sieve methods to develop novel exponential sum estimates in the style of Rice, and we use the ``random sparsification'' procedure of Green and Sawhney.

39 pages, We made substantial changes to improve the bound for density to \exp(-c_h(\log{X})^μ) for any 0<μ\leq 1/2 from 0<μ\leq 1/4