A Quantitative Result on Diophantine Approximation for Intersective Polynomials
classification
🧮 math.NT
math.CAmath.CO
keywords
polynomialsresultapproachapproximationbestboundbriefclass
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.