Integer part independent polynomial averages and applications along primes
Dimitris Karageorgos, Andreas Koutsogiannis

TL;DR
This paper proves convergence of ergodic averages involving integer parts of strongly independent polynomials and applies these results to obtain combinatorial theorems along primes.
Contribution
It establishes mean convergence of polynomial-based ergodic averages with integer parts and derives new combinatorial results along primes using advanced ergodic theory methods.
Findings
Convergence of polynomial ergodic averages with integer parts.
New combinatorial theorems along primes.
Application of nilmanifold equidistribution techniques.
Abstract
Exploiting the equidistribution properties of polynomial sequences, following the methods developed by Leibman ("Pointwise Convergence of ergodic averages for polynomial sequences of translations on a nilmanifold. Ergodic Theory Dynam. Systems, 25 (2005) no. 1, 201-213") and Frantzikinakis ("Multiple recurrence and convergence for Hardy field sequences of polynomial growth. Journal d'Analyse Mathematique, 112 (2010), 79-135" and "Equidistribution of sparse sequences on nilmanifolds. Journal d'Analyse Mathematique, 109 (2009), 353-395") we show that the ergodic averages with iterates given by the integer part of real-valued strongly independent polynomials, converge in the mean to the "right"-expected limit. These results have, via Furstenberg's correspondence principle, immediate combinatorial applications while combining these results with methods from "The polynomial multidimensional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
