English

Simultaneous Polynomial Recurrence

Classical Analysis and ODEs 2014-02-26 v1 Combinatorics Number Theory

Abstract

Let A{1,...,N}A\subseteq\{1,...,N\} and P1,...,PZ[n]P_1,...,P_\ell\in\Z[n] with Pi(0)=0P_i(0)=0 and degPi=k\deg P_i=k for every 1i1\leq i\leq\ell. We show, using Fourier analytic techniques, that for every \VE>0\VE>0, there necessarily exists nNn\in\N such that A(A+Pi(n))N>(AN)2\VE\frac{|A\cap (A+P_i(n))|}{N}>(\frac{|A|}{N})^2-\VE holds simultaneously for 1i1\leq i\leq \ell (in other words all of the polynomial shifts of the set AA intersect AA "\VE\VE-optimally"), as long as NN1(\VE,P1,...,P)N\geq N_1(\VE,P_1,...,P_\ell). The quantitative bounds obtained for N1N_1 are explicit but poor; we establish that N1N_1 may be taken to be a constant (depending only on P1,...,PP_1,...,P_\ell) times a tower of 2's of height Ck,+C\eps2C_{k,\ell}^*+C\eps^{-2}.

Keywords

Cite

@article{arxiv.1009.0766,
  title  = {Simultaneous Polynomial Recurrence},
  author = {Neil Lyall and Akos Magyar},
  journal= {arXiv preprint arXiv:1009.0766},
  year   = {2014}
}
R2 v1 2026-06-21T16:09:20.942Z