Towers for commuting endomorphisms, and combinatorial applications
Dynamical Systems
2016-01-29 v2 Combinatorics
Abstract
We give an elementary proof of a generalization of Rokhlin's lemma for commuting non-invertible measure-preserving transformations, and we present several combinatorial applications.
Cite
@article{arxiv.1507.07010,
title = {Towers for commuting endomorphisms, and combinatorial applications},
author = {Artur Avila and Pablo Candela},
journal= {arXiv preprint arXiv:1507.07010},
year = {2016}
}
Comments
13 pages. Referee's comments incorporated. To appear in Annales de l'Institut Fourier