Simultaneous Polynomial Recurrence
Classical Analysis and ODEs
2014-02-26 v1 Combinatorics
Number Theory
Abstract
Let and with and for every . We show, using Fourier analytic techniques, that for every , there necessarily exists such that 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 .
Keywords
Cite
@article{arxiv.1009.0766,
title = {Simultaneous Polynomial Recurrence},
author = {Neil Lyall and Akos Magyar},
journal= {arXiv preprint arXiv:1009.0766},
year = {2014}
}