A purely combinatorial approach to simultaneous polynomial recurrence modulo 1

DOI10.1090/PROC/12333MaRDI QIDQ5255232zbMATH OpenOpenAlexFDO

Authors Ernie Croot, Neil Lyall, Alex Rice

Publication date 12 June 2015

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

quadratic polynomialsKronecker approximation theoremsimultaneous quadratic recurrence

Mathematics Subject Classification ID

Distribution modulo one (11J71) Small fractional parts of polynomials and generalizations (11J54)

Abstract: Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.

Cites work

• scientific article; zbMATH DE number 5528961 (Why is no real title available?)
• scientific article; zbMATH DE number 5635018 (Why is no real title available?)
• scientific article; zbMATH DE number 3563248 (Why is no real title available?)
• On Hilbert's solution of Waring's problem
• Simultaneous polynomial recurrence

This page was built for publication: A purely combinatorial approach to simultaneous polynomial recurrence modulo 1

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