Rotated Odometers and Actions on Rooted Trees
Henk Bruin, Olga Lukina

TL;DR
This paper studies rotated odometers, a type of infinite interval exchange transformation, showing their connection to actions on rooted trees and the adding machine, with implications for group actions on binary trees.
Contribution
It establishes a measurable isomorphism between rotated odometers with dyadic intervals and actions on rooted trees, highlighting the role of the adding machine.
Findings
Rotated odometers are measurably isomorphic to $bZ$-actions on rooted trees.
The minimal aperiodic subsystem corresponds to the adding machine.
Applications to group actions on binary trees are discussed.
Abstract
A rotated odometer is an infinite interval exchange transformation (IET) obtained as a composition of the von Neumann-Kakutani map and a finite IET of intervals of equal length. In this paper, we consider rotated odometers for which the finite IET is of intervals of length , for some . We show that every such system is measurably isomorphic to a -action on a rooted tree, and that the unique minimal aperiodic subsystem of this action is always measurably isomorphic to the action of the adding machine. We discuss the applications of this work to the study of group actions on binary trees.
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
TopicsCellular Automata and Applications · Mathematical Dynamics and Fractals · Theoretical and Computational Physics
