Textile systems on lambda-graph systems
| dc.creator | Matsumoto, Kengo | |
| dc.date | 2006-07-21 | |
| dc.date.accessioned | 2026-07-07T07:20:46Z | |
| dc.date.available | 2026-07-07T07:20:46Z | |
| dc.description | The notions of symbolic matrix system and $λ$-graph system for a subshift are generalizations of symbolic matrix and $λ$-graph (= finite symbolic matrix) for a sofic shift respectively ([Doc. Math. 4(1999), 285-340]). M. Nasu introduced the notion of textile system for a pair of graph homomorphisms to study automorphisms and endomorphisms of topological Markov shifts ([Mem. Amer. Math. Soc. 546,114(1995)]). In this paper, we formulate textile systems on $λ$-graph systems and study automorphisms on subshifts. We will prove that for a forward automorphism $ϕ$ of a subshift $(Λ,σ)$, the automorphisms $ϕ^k σ^n, k\ge 0, n\ge 1$ can be explicitly realized as a subshift defined by certain symbolic matrix systems coming from both the strong shift equivalence representing $ϕ$ and the subshift $(Λ,σ)$. As an application of this result, if an automorphism $ϕ$ of a subshift $Λ$ is a simple automorphism, the dynamical system $(Λ, ϕ\circ σ)$ is topologically conjugate to the subshift $(Λ, σ).$ | |
| dc.description | 40pages, AMStexfile | |
| dc.identifier | https://arxiv.org/abs/math/0607520 | |
| dc.identifier | http://arxiv.org/abs/math/0607520 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115066 | |
| dc.subject | Operator Algebras | |
| dc.subject | Dynamical Systems | |
| dc.subject | 37B10;54H20 | |
| dc.title | Textile systems on lambda-graph systems | |
| dc.type | text |