加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本