A purely combinatorial approach to simultaneous polynomial recurrence modulo 1

DOI10.1090/PROC/12333zbMATH Open1378.11073arXiv1307.0779OpenAlexW2963055354MaRDI QIDQ5255232FDOQ5255232

Ernie Croot, Alex Rice, Neil Lyall

Publication date: 12 June 2015

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On Hilbert's solution of Waring's problem
• Title not available (Why is that?)
• 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)