ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS
From MaRDI portal
(Redirected from Publication:5489182)
Abstract: Szemer'edi's Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain arbitrarily long polynomial configurations; Szemer'edi's Theorem corresponds to the linear case of the polynomial theorem. We focus on the case farthest from the linear case, that of rationally independent polynomials. We derive results in ergodic theory and in combinatorics for rationally independent polynomials, showing that their behavior differs sharply from the general situation.
Recommendations
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- Multiple ergodic averages for three polynomials and applications
- Integer part independent polynomial averages and applications along primes
- Ergodic structures and non-conventional ergodic theorems
- Intersective polynomials and the polynomial Szemerédi theorem
Cited in
(32)- Trigonometric polynomials and multidimensional random walks: Application to the ergodic theory
- Semi-progressions
- Polynomial configurations in sets of positive upper density over local fields
- Complexity of nilsystems and systems lacking nilfactors
- Equidistribution of sparse sequences on nilmanifolds
- Juxtaposing combinatorial and ergodic properties of large sets of integers
- Joint ergodicity of sequences
- Polynomial multiple recurrence over rings of integers
- Polynomial largeness of sumsets and totally ergodic sets
- Joint ergodicity along generalized linear functions
- Multiple recurrence for two commuting transformations
- On polynomial ergodic averages and square functions
- Multiple ergodic averages for three polynomials and applications
- Polynomially Moving Ergodic Averages
- Some open problems on multiple ergodic averages
- Optimal lower bounds for multiple recurrence
- True complexity of polynomial progressions in finite fields
- Integer part independent polynomial averages and applications along primes
- Multiple recurrence for non-commuting transformations along rationally independent polynomials
- A multidimensional Szemerédi theorem for Hardy sequences of different growth
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- On several notions of complexity of polynomial progressions
- Multiple ergodic averages along functions from a Hardy field: convergence, recurrence and combinatorial applications
- Multiple recurrence and convergence without commutativity
- Multiple recurrence and popular differences for polynomial patterns in rings of integers
- Multiple recurrence and convergence for Hardy sequences of polynomial growth
- Recurrence properties of superadditive processes and universally good weights
- Joint ergodicity for commuting transformations and applications to polynomial sequences
- An inverse of Furstenberg's correspondence principle and applications to nice recurrence
- The primes contain arbitrarily long polynomial progressions
- Complexities of finite families of polynomials, Weyl systems, and constructions in combinatorial number theory
- Intersective polynomials and the polynomial Szemerédi theorem
This page was built for publication: ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5489182)