Optimal polynomial recurrence

DOI10.4153/CJM-2012-003-8MaRDI QIDQ4907627zbMATH OpenOpenAlexFDO

Authors Neil Lyall, Ákos Magyar

Publication date 4 February 2013

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

polynomial return timesSarközy theoremsyndetic

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30)

Abstract: Let $$ with $P(0)=0$ and $VE>0$. We show, using Fourier analytic techniques, that if $Ngeqexpexp(CV{E}^{-1}logV{E}^{-1})$ and $Asubseteq1,\mathrm{...},N$, then there must exist $ninN$ such that [frac{|Acap (A+P(n))|}{N}>(frac{|A|}{N})^2-VE.] In addition to this we also show, using the same Fourier analytic methods, that if $AsubseteqN$, then the set of emph{$VE$-optimal return times} [R(A,P,VE)={nin N ,:,D(Acap(A+P(n)))>D(A)^2-VE}] is syndetic for every $VE>0$. Moreover, we show that $R(A,P,VE)$ is emph{dense} in every sufficiently long interval, in the sense that there exists an $L=L(VE,P,A)$ such that [|R(A,P,VE)cap I| geq c(VE,P)|I|] for all intervals $I$ of natural numbers with $|I|geqL$ and $c(VE,P)=expexp(-C,V{E}^{-1}logV{E}^{-1})$.

Recommendations

• Simultaneous polynomial recurrence
• Single and multiple recurrence along non-polynomial sequences
• scientific article; zbMATH DE number 936375
• IP-systems, generalized polynomials and recurrence
• Optimal lower bounds for multiple recurrence

Cited in

(3)

• Simultaneous polynomial recurrence
• Bounds in a popular multidimensional nonlinear Roth theorem
• Polynomial progressions in topological fields

This page was built for publication: Optimal polynomial recurrence

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