Towers for commuting endomorphisms, and combinatorial applications
Artur Avila, Pablo Candela
TL;DR
This paper provides an elementary proof of a generalized Rokhlin's lemma for commuting non-invertible measure-preserving transformations and explores various combinatorial applications.
Contribution
It introduces a new elementary proof of a generalized Rokhlin's lemma and applies it to multiple combinatorial problems.
Findings
Elementary proof of generalized Rokhlin's lemma
New combinatorial applications demonstrated
Enhanced understanding of commuting endomorphisms
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Computability, Logic, AI Algorithms