Textile systems on lambda-graph systems

Details Textile systems on lambda-graph systems Textile systems on lambda-graph systems

2006-07-21

arxiv.org/abs/math/0607520v1

Mathematics

Operator Algebras

40pages, AMStexfile

Scientific paper

The notions of symbolic matrix system and $\lambda$-graph system for a subshift are generalizations of symbolic matrix and $\lambda$-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 $\lambda$-graph systems and study automorphisms on subshifts. We will prove that for a forward automorphism $\phi$ of a subshift $(\Lambda,\sigma)$, the automorphisms $\phi^k \sigma^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 $\phi$ and the subshift $(\Lambda,\sigma)$. As an application of this result, if an automorphism $\phi$ of a subshift $\Lambda$ is a simple automorphism, the dynamical system $(\Lambda, \phi \circ \sigma)$ is topologically conjugate to the subshift $(\Lambda, \sigma).$

Affiliated with

Also associated with

No associations

Rating

Textile systems on lambda-graph systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Textile systems on lambda-graph systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Textile systems on lambda-graph systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-169754