Simultaneous polynomial recurrence

DOI10.1112/BLMS/BDR011MaRDI QIDQ5199337zbMATHOpenAlexFDO

Authors Neil Lyall, Ákos Magyar

Publication date 16 August 2011

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1009.0766

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30)

Abstract: Let $Asubseteq1,\mathrm{...},N$ and $$ with $P_i(0)=0$ and $deg{P}_i=k$ for every $1leqileqell$. We show, using Fourier analytic techniques, that for every $VE>0$, there necessarily exists $ninN$ such that [frac{|Acap (A+P_i(n))|}{N}>(frac{|A|}{N})^2-VE] holds simultaneously for $1leqileqell$ (in other words all of the polynomial shifts of the set $A$ intersect $A$ "$VE$-optimally"), as long as $Ngeq{N}_1(VE,P_1,\mathrm{...},P_{e}ll)$. The quantitative bounds obtained for $N_1$ are explicit but poor; we establish that $N_1$ may be taken to be a constant (depending only on $P_1,\mathrm{...},P_{e}ll$) times a tower of 2's of height $C_{k,ell}^{\ast }+Cep{s}^{-2}$.

Recommendations

• Optimal polynomial recurrence
• An ergodic IP polynomial Szemerédi theorem
• scientific article; zbMATH DE number 936375
• Sets of recurrence as bases for the positive integers
• Polynomial multiple recurrence over rings of integers

Cited in

(7)

• Some open problems on multiple ergodic averages
• Sets of recurrence as bases for the positive integers
• A purely combinatorial approach to simultaneous polynomial recurrence modulo 1
• A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
• Polynomial recurrence with large intersection over countable fields
• Optimal polynomial recurrence
• Simultaneous Polaczek polynomials

This page was built for publication: Simultaneous polynomial recurrence

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