Simultaneous polynomial recurrence
From MaRDI portal
Publication:5199337
DOI10.1112/BLMS/BDR011zbMATH Open1269.11012arXiv1009.0766OpenAlexW2130936355MaRDI QIDQ5199337FDOQ5199337
Authors: Neil Lyall, Ákos Magyar
Publication date: 16 August 2011
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Abstract: Let and with and for every . We show, using Fourier analytic techniques, that for every , there necessarily exists such that [frac{|Acap (A+P_i(n))|}{N}>(frac{|A|}{N})^2-VE] holds simultaneously for (in other words all of the polynomial shifts of the set intersect "-optimally"), as long as . The quantitative bounds obtained for are explicit but poor; we establish that may be taken to be a constant (depending only on ) times a tower of 2's of height .
Full work available at URL: https://arxiv.org/abs/1009.0766
Recommendations
Cited In (7)
- Polynomial recurrence with large intersection over countable fields
- Optimal polynomial recurrence
- Simultaneous Polaczek polynomials
- 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
- Some open problems on multiple ergodic averages
- Sets of recurrence as bases for the positive integers
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)