Towers for commuting endomorphisms, and combinatorial applications
classification
🧮 math.DS
math.CO
keywords
applicationscombinatorialcommutingelementaryendomorphismsgeneralizationgivelemma
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.