2000 character limit reached
A Quantitative Result on Diophantine Approximation for Intersective Polynomials
Published 21 Apr 2014 in math.NT, math.CA, and math.CO | (1404.5161v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.