arXiv:1404.5161 [math.NT]AbstractReferencesReviewsResources
A Quantitative Result on Diophantine Approximation for Intersective Polynomials
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.
Comments: 6 pages
Related articles: Most relevant | Search more
Diophantine approximation and coloring
On some open problems in Diophantine approximation
arXiv:1905.01512 [math.NT] (Published 2019-05-04)
Transference theorems for Diophantine approximation with weights