Graph towers, laminations and their invariant measures
arXiv:1503.08000 · doi:10.1112/jlms.12300
Abstract
In this paper we present a combinatorial machinery, consisting of a graph tower and vector towers on , which allows us to efficiently describe all invariant measures on any given shift space over a finite alphabet. The new technology admits a number of direct applications, in particular concerning invariant measures on non-primitive substitution subshifts, minimal subshifts with many ergodic measures, or an efficient calculation of the measure of a given cylinder. It also applies to currents on a free group , and in particular the set of projectively fixed currents under the action of a (possibly reducible) endomorphism is determined, when is represented by a train track map.
arXiv comment52 pages, 3 figures. This is rather a new paper than a new version of the old one. The setting is much more general, and also closer to a symbolic dynamics spirit. Also, some of the work from the original paper has been removed and will be taken up in a forthcoming paper. Accepted in Journal of London Mathematical society. To appear 2019
References in corpus (8)
- -trees and laminations for free groups II: The dual lamination of an -tree
- -trees and laminations for free groups I: Algebraic laminations
- Beyond substitutive dynamical systems: S-adic expansions
- Limit theorems for self-similar tilings
- North-South dynamics of hyperbolic free group automorphisms on the space of currents
- Ergodic decompositions for folding and unfolding paths in Outer space
- Dynamics of hyperbolic iwips
- The constant of recognizability is computable for primitive morphisms