A quantitative result on Diophantine approximation for intersective polynomials
From MaRDI portal
Publication:2829182
zbMATH Open1387.11047arXiv1404.5161MaRDI QIDQ2829182FDOQ2829182
Authors: 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.)
Recommendations
- Intersective polynomials and Diophantine approximation
- Intersective polynomials and Diophantine approximation. II
- scientific article; zbMATH DE number 1363200
- Diophantine approximation on polynomial curves
- On some results in the problem of diophantine approximation of functions by polynomials
- scientific article; zbMATH DE number 3933684
- 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
- scientific article; zbMATH DE number 4212684
Cited In (3)
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)