Graph towers, laminations and their invariant measures

preprint2019arXivOpen access

Abstract

In this paper we present a combinatorial machinery, consisting of a graph tower Γ←\overleftarrow Γ and vector towers v←\overleftarrow v on Γ←\overleftarrow Γ, which allows us to efficiently describe all invariant measures μ=μv←μ= μ^{\overleftarrow v} 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 FNF_N, and in particular the set of projectively fixed currents under the action of a (possibly reducible) endomorphism φ:FN→FNφ: F_N \to F_N is determined, when φφ is represented by a train track map.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.