Bratteli-Vershik models and graph covering models (Q2173720)

The author constructs basic graph covering models for general zero-dimensional systems. In doing so, he develops the new notion of weighted graph covering models in which to each edge is assigned a weight corresponding to its length. The flexible graph covering models are defined, without explicitly assigning the edge lengths. The main result of the paper is following: Theorem. Let \((X, f)\) be an invertible zero-dimensional system. For every sequence \(l : l_1 < l_2 <\cdots\) of positive integers, \((X, f)\) admits a bidirectional weighted graph covering model \(\mathcal{G} : \overline{G}_0 \xleftarrow{\varphi_1} G_1 \xleftarrow{\varphi_2} G_2 \xleftarrow{\varphi_3}\cdots\) that is \(l\)-periodicity-regulated. It follows that \(\overline{V}_{\infty}\) is a basic set. The same is true for \(\widetilde{\mathcal{G}}\) and \(\overline{V}_{\infty}\) via the given argument. Here, \(G_1,G_2\) and \(G_3\) are basic graphs. The author proves that there exists some \(l\)-periodicity-regulated weighted graph covering model \(\mathcal{G} : \overline{G}_0 \xleftarrow{\varphi_1} G_1 \xleftarrow{\varphi_2} G_2 \xleftarrow{\varphi_3}\cdots\) with \(\underset{\longleftarrow}{\lim }\, \mathcal{G}\) being topologically conjugate to \((X, f)\). Some examples to provide an intuitive understanding are presented. Then, the relations with the Bratteli-Vershik models are described. The author proves that an arbitrary invertible zero-dimensional system admits the Bratteli-Vershik model that satisfies the latter regularity condition. Also, the author shows that \(\mathcal{G}\) can be transformed to a Bratteli-Vershik model of \((X, f)\) and that a Bratteli-Vershik model \((V, E,\geq, \psi)\) has the closing property if and only if the set \(E_{0,\infty,\min}\) is a basic set. In the last section, stationary graph covering models are defined and some examples of stationary graph covering models are presented. The author constructs some class of transitive substitution subshifts.