A quantitative result on Diophantine approximation for intersective polynomials

zbMATH Open1387.11047arXiv1404.5161MaRDI QIDQ2829182FDOQ2829182

Neil Lyall, Alex Rice

Publication date: 27 October 2016

Published in: Integers (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1404.5161

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

intersective polynomialsKronecker approximation theorem

Mathematics Subject Classification ID

Small fractional parts of polynomials and generalizations (11J54)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Intersective polynomials and Diophantine approximation 👍 👎
• Intersective polynomials and Diophantine approximation. II 👍 👎
• Title not available (Why is that?) 👍 👎
• Diophantine approximation on polynomial curves 👍 👎
• On some results in the problem of diophantine approximation of functions by polynomials 👍 👎
• Title not available (Why is that?) 👍 👎
• SIMULTANEOUS DIOPHANTINE APPROXIMATION ON POLYNOMIAL CURVES 👍 👎
• Diophantine approximation of polynomials over \(\mathbb{F}_q[t\) satisfying a divisibility condition] 👍 👎
• Some New Results in Quantitative Diophantine Approximation 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A quantitative result on Diophantine approximation for intersective polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829182)