A Quantitative Result on Diophantine Approximation for Intersective Polynomials
Number Theory
2014-04-22 v1 Classical Analysis and ODEs
Combinatorics
Abstract
In this short note, we closely follow the approach of Green and Tao to extend the best known bound for recurrence modulo 1 from squares to the largest possible class of polynomials. The paper concludes with a brief discussion of a consequence of this result for polynomials structures in sumsets and limitations of the method.
Cite
@article{arxiv.1404.5161,
title = {A Quantitative Result on Diophantine Approximation for Intersective Polynomials},
author = {Neil Lyall and Alex Rice},
journal= {arXiv preprint arXiv:1404.5161},
year = {2014}
}
Comments
6 pages