Ergodic Averages for Independent Polynomials and Applications

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Szemerédi'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édi'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.
12 pages

Keywords

Dynamical Systems, Combinatorics, 37A45, 37A30, 28D05, 05D10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/100973

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0412177
 http://arxiv.org/abs/math/0412177

Collections

arXiv