Characterization and topological behavior of homomorphism tree-shifts
From MaRDI portal
Publication:2230907
Dynamical systems involving transformations and group actions with special properties (minimality, distality, proximality, expansivity, etc.) (37B05) Symbolic dynamics (37B10) Topological entropy (37B40) Dynamical systems involving maps of trees and graphs (37E25) Multidimensional shifts of finite type (37B51)
Abstract: The purpose of this article is twofold. On one hand, we reveal the equivalence of shift of finite type between a one-sided shift and its associated hom tree-shift , as well as the equivalence in the sofic shift. On the other hand, we investigate the interrelationship among the comparable mixing properties on tree-shifts as those on multidimensional shift spaces. They include irreducibility, topologically mixing, block gluing, and strong irreducibility, all of which are defined in the spirit of classical multidimensional shift, complete prefix code (CPC), and uniform CPC. In summary, the mixing properties defined in all three manners coincide for . Furthermore, an equivalence between irreducibility on and irreducibility on are seen, and so is one between topologically mixing on and mixing property on , where is the one-sided shift space induced by the matrix and is the associated tree-shift. These equivalences are consistent with the mixing properties on or when viewed as a degenerate tree-shift.
Recommendations
Cites work
- A small aperiodic set of Wang tiles
- An Introduction to Symbolic Dynamics and Coding
- Bounded density shifts
- Entropy on regular trees
- Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces
- Mixing properties for hom-shifts and the distance between walks on associated graphs
- Mixing properties of tree-shifts
- Multidimensional sofic shifts without separation and their factors
- On independence and entropy for high-dimensional isotropic subshifts
- Sofic tree-shifts
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- The undecidability of the domino problem
- Tree shift topological entropy
- Tree-shifts of finite type
- Tree-shifts: Irreducibility, mixing, and the chaos of tree-shifts
- Undecidability and nonperiodicity for tilings of the plane
- Uniform sampling of subshifts of finite type on grids and trees
Cited in
(6)- Large deviation principle of multiplicative Ising models on Markov-Cayley trees
- Mixing properties of tree-shifts
- On mixing properties of Markov tree-shifts
- On homomorphisms of n-D behaviors
- Topological entropy for shifts of finite type over \(\mathbb{Z}\) and trees
- An analogue of topological sequence entropy for Markov hom tree-shifts
This page was built for publication: Characterization and topological behavior of homomorphism tree-shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230907)