Ergodic Averages for Independent Polynomials and Applications

Simple item page
dc.creatorFrantzikinakis, Nikos
dc.creatorKra, Bryna
dc.date2004-12-08
dc.date2006-03-29
dc.date.accessioned2026-07-07T06:39:08Z
dc.date.available2026-07-07T06:39:08Z
dc.descriptionSzemeré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.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/math/0412177
dc.identifierhttp://arxiv.org/abs/math/0412177
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/100973
dc.subjectDynamical Systems
dc.subjectCombinatorics
dc.subject37A45, 37A30, 28D05, 05D10
dc.titleErgodic Averages for Independent Polynomials and Applications
dc.typetext

Files

Collections

arXiv