Results 1 to 10 of about 100 (60)
A characterization of the entropies of multidimensional shifts of finite type [PDF]
Annals of Mathematics, 2010 We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right recursively enumerable, i.e. there is a computable sequence of rational numbers converging to $h$ from above.
Hochman, Michael, Meyerovitch, Tom
exaly +7 more sources
On the automorphism groups of multidimensional shifts of finite type [PDF]
Ergodic Theory and Dynamical Systems, 2009 AbstractWe investigate algebraic properties of the automorphism group of multidimensional shifts of finite type (SFTs). We show that positive entropy implies that the automorphism group contains every finite group and, together with transitivity, implies that the center of the automorphism group is trivial (i.e. consists only of the shift action).
M. Hochman
openaire +2 more sources
On graph induced symbolic systems [PDF]
Applied General Topology, 2023 In this paper, we investigate shift spaces arising from a multidimensional graph G. In particular, we investigate nonemptiness and existence of periodic points for a multidimensional shift space.
Prashant Kumar, Puneet Sharma
doaj +2 more sources
Matrix characterization of multidimensional subshifts of finite type [PDF]
Applied General Topology, 2019 Let X ⊂ AZd be a 2-dimensional subshift of finite type. We prove that any 2-dimensional subshift of finite type can be characterized by a square matrix of infinite dimension. We extend our result to a general d-dimensional case.
Puneet Sharma, Dileep Kumar
doaj +2 more sources
Classification of sofic projective subdynamics of multidimensional shifts of finite type
Transactions of the American Mathematical Society, 2014 Motivated by Hochman’s notion of subdynamics of a Z d \mathbb {Z}^d
Pavlov, Ronnie, Schraudner, Michael
openaire +5 more sources
Short-range and long-range order: a transition in block-gluing behavior in Hom shifts [PDF]
Journal d'Analyse Mathematique, 2022 Hom shifts form a class of multidimensional shifts of finite type (SFT) and consist of colorings of the grid ℤ2 where adjacent colors must be neighbors in a fixed finite undirected simple graph G. This class includes several important statistical physics
Silvère Gangloff +2 more
semanticscholar +1 more source
Characterization and topological behavior of homomorphism tree-shifts [PDF]
Topology and its Applications, 2021 The purpose of this article is twofold. On one hand, we reveal the equivalence of shift of finite type between a one-sided shift X and its associated hom tree-shift TX , as well as the equivalence in the sofic shift. On the other hand, we investigate the
Jung-Chao Ban +4 more
semanticscholar +1 more source
Diddy: a Python toolbox for infinite discrete dynamical systems [PDF]
International Workshop on Cellular Automata and Discrete Complex Systems, 2023 We introduce Diddy, a collection of Python scripts for analyzing infinite discrete dynamical systems. The main focus is on generalized multidimensional shifts of finite type (SFTs).
Ville Salo, Ilkka Törmä
semanticscholar +1 more source
Characterization for entropy of shifts of finite type on Cayley trees [PDF]
Journal of Statistical Mechanics: Theory and Experiment, 2017 The notion of tree-shifts constitutes an intermediate class between one-sided shift spaces and multidimensional ones. This paper proposes an algorithm for computing the entropy of a tree-shift of finite type.
Jung-Chao Ban, Chih-Hung Chang
semanticscholar +1 more source
The expressiveness of quasiperiodic and minimal shifts of finite type [PDF]
Ergodic Theory and Dynamical Systems, 2018 We study multidimensional minimal and quasiperiodic shifts of finite type. We prove for these classes several results that were previously known for the shifts of finite type in general, without restriction.
B. Durand, Andrei E. Romashchenko
semanticscholar +1 more source