Graph covers and ergodicity for zero-dimensional systems

DOI10.1017/ETDS.2014.72zbMATH Open1355.37008arXiv1506.06515OpenAlexW3102199746MaRDI QIDQ2808043FDOQ2808043

Takashi Shimomura

Publication date: 26 May 2016

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Abstract: Bratteli--Vershik systems have been widely studied. In the context of general 0-dimensional systems, Bratteli--Vershik systems are homeomorphisms that have Kakutani--Rohlin refinements. Bratteli diagram has a strong power to analyze such systems. Besides this approach, general graph covers can be used to represent any 0-dimensional system. Indeed, all 0-dimensional systems can be described as a certain kind of sequences of graph covers that may not be brought about by the Kakutani--Rohlin partitions. In this paper, we follow the context of general graph covers to analyze the relations between ergodic measures and circuits of graph covers. First, we formalize the condition for a sequence of graph covers to represent minimal Cantor systems. In constructing invariant measures, we deal with general compact metrizable 0-dimensional systems. In the context of Bratteli diagrams with finite rank, it has previously been mentioned that all ergodic measures should be limits of some combinations of towers of Kakutani--Rohlin refinements. We demonstrate this for general 0-dimensional case, and develop a theorem that expresses the coincidence of the time average and the space average for ergodic measures. Additionally, we formulate a theorem that signifies the old relation between uniform convergence and unique ergodicity in the context of graph circuits for general 0-dimensional systems. Unlike previous studies, in our case of general graph covers, there arise a possibility of linear dependence of circuits. We give a condition for a full circuit system to be linearly independent. Previous researches also showed that the bounded combinatorics imply unique ergodicity. We present a lemma that enables us to consider unbounded ranks of winding matrices.

Full work available at URL: https://arxiv.org/abs/1506.06515

zbMATH Keywords

combinatoricsergodic measuresBratteli-Vershik systemsgraph coversKakutani-Rohlin refinementszero-dimensional systems

Mathematics Subject Classification ID

Ergodicity, mixing, rates of mixing (37A25) Infinite graphs (05C63) General groups of measure-preserving transformations and dynamical systems (37A15) Symbolic dynamics (37B10)

Cites Work

• Special homeomorphisms and approximation for Cantor systems
• ORDERED BRATTELI DIAGRAMS, DIMENSION GROUPS AND TOPOLOGICAL DYNAMICS
• Bratteli–Vershik models for Cantor minimal systems: applications to Toeplitz flows
• Finite rank Bratteli diagrams: structure of invariant measures
• Algebraic topology for minimal Cantor sets
• Generically there is but one self homeomorphism of the Cantor set
• Cantor aperiodic systems and Bratteli diagrams
• Construction of almost automorphic symbolic minimal flows

Cited In (12)

• The isomorphism class of the shift map
• Rank 2 proximal Cantor systems are residually scrambled
• Shifts of finite type as fundamental objects in the theory of shadowing
• Combinatorial embedding of chain transitive zero-dimensional systems into chaos
• TOPOLOGICAL RANK DOES NOT INCREASE BY NATURAL EXTENSION OF CANTOR MINIMALS
• Graph covers of higher dimensional dynamical systems
• Zero-dimensional covers of finite dimensional dynamical systems
• All minimal Cantor systems are slow
• Zero-dimensional almost 1-1 extensions of odometers from graph coverings
• Bratteli-Vershik models and graph covering models
• Edrei's conjecture revisited
• The construction of a completely scrambled system by graph covers

This page was built for publication: Graph covers and ergodicity for zero-dimensional systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808043)