A Maximal Extension of the Best-Known Bounds for the Furstenberg-Sárközy Theorem

preprint2020arXivOpen access

Abstract

We show that if h∈Z[x]h\in \mathbb{Z}[x] is a polynomial of degree k≥2k \geq 2 such that h(N)h(\mathbb{N}) contains a multiple of qq for every q∈Nq\in \mathbb{N}, known as an intersective polynomial\textit{intersective polynomial}, then any subset of {1,2,…,N}\{1,2,\dots,N\} with no nonzero differences of the form h(n)h(n) for n∈Nn\in\mathbb{N} has density at most a constant depending on hh and cc times (log⁡N)−clog⁡log⁡log⁡log⁡N(\log N)^{-c\log\log\log\log N}, for any c<(log⁡((k2+k)/2))−1c<(\log((k^2+k)/2))^{-1}. Bounds of this type were previously known only for monomials and intersective quadratics, and this is currently the best-known bound for the original Furstenberg-Sárközy Theorem, i.e. h(n)=n2h(n)=n^2. The intersective condition is necessary to force any density decay for polynomial difference-free sets, and in that sense our result is the maximal extension of this particular quantitative estimate. Further, we show that if g,h∈Z[x]g,h\in \mathbb{Z}[x] are intersective, then any set lacking nonzero differences of the form g(m)+h(n)g(m)+h(n) for m,n∈Nm,n\in \mathbb{N} has density at most exp⁡(−c(log⁡N)μ)\exp(-c(\log N)^μ), where c=c(g,h)>0c=c(g,h)>0, μ=μ(deg(g),deg(h))>0μ=μ(\text{deg}(g),\text{deg}(h))>0, and μ(2,2)=1/2μ(2,2)=1/2. We also include a brief discussion of sums of three or more polynomials in the final section.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.