Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A note on nonexpansive, essentially LR automorphisms of topological Markov shifts - MaRDI portal

A note on nonexpansive, essentially LR automorphisms of topological Markov shifts (Q368690)

From MaRDI portal





scientific article; zbMATH DE number 6210535
Language Label Description Also known as
English
A note on nonexpansive, essentially LR automorphisms of topological Markov shifts
scientific article; zbMATH DE number 6210535

    Statements

    A note on nonexpansive, essentially LR automorphisms of topological Markov shifts (English)
    0 references
    0 references
    23 September 2013
    0 references
    An automorphism \(\phi\) (that is, a shift-commuting homeomorphism) of a topological Markov shift \((X_G,\sigma_G)\) defined by a graph \(G\) is said to be LR if there is a graph \(G'\) and topological conjugacies \(\xi:(X_{G'},\sigma_{G'}) \to(X_G,\sigma_G)\) and \(\eta:(X_{G'},\sigma_{G'}) \to(X_G,\sigma_G)\) with the property that \(\phi=\eta\xi^{-1}\), where \(\xi\) is given by a left-resolving graph-homorphism and \(\eta\) is given by a right-resolving one. An automorphism of a topological Markov shift is said to be essentially LR if it is topologically conjugate to an LR automorphism in the previous sense. Here it is shown that there is a non-expansive essentially LR automorphism \(\phi\) of the full shift on two symbols with the property that \(\phi^n\) is not LR for any \(n\in\mathbb N\). This complements an earlier result of the author [Mem. Am. Math. Soc. 546, 215 p. (1995; Zbl 0845.54031)] that if \(\phi\) is an expansive essentially LR automorphism of a topological Markov shift, then there is some \(m\in\mathbb N\) with the property that \(\phi^n\) is an LR automorphism for all \(n\geq m\). The construction makes use of the textile machinery developed by the author.
    0 references
    symbolic dynamics
    0 references
    topological Markov shift
    0 references
    textile system
    0 references
    automorphism
    0 references

    Identifiers