arXiv Analytics

Sign in

arXiv:1404.5161 [math.NT]AbstractReferencesReviewsResources

A Quantitative Result on Diophantine Approximation for Intersective Polynomials

Neil Lyall, Alex Rice

Published 2014-04-21Version 1

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.

Related articles: Most relevant | Search more
arXiv:1308.0208 [math.NT] (Published 2013-08-01, updated 2014-02-20)
Diophantine approximation and coloring
arXiv:1202.4539 [math.NT] (Published 2012-02-21, updated 2012-12-22)
On some open problems in Diophantine approximation
arXiv:1905.01512 [math.NT] (Published 2019-05-04)
Transference theorems for Diophantine approximation with weights