A Purely Combinatorial Approach to Simultaneous Polynomial Recurrence Modulo 1

2013/07/02 by Ernie Croot, Croot, Ernie, Neil Lyall +3
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #math.CO #math.NT

paper · pdf · doi:10.48550/arxiv.1307.0779

6 pages

arxiv created 2013/07/02 · arxiv updated 2013/07/03

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.

Related

• Intersective polynomials and Diophantine approximation, II
• A Quantitative Result on Diophantine Approximation for Intersective Polynomials
• On congruence schemes for constant terms and their applications
• Simultaneous Diophantine approximation: sums of squares and homogeneous\n polynomials
• Creating Decidable Diophantine Equations