Entropy dimension of shift spaces on monoids

Abstract

We consider the entropy dimension of G-shifts of finite type for the case where G is a non-Abelian monoid. Entropy dimension tells us whether a shift space has zero topological entropy. Suppose the Cayley graph C-G of G has a finite representation (that is, {C-gG : g is an element of G} is a finite set up to graph isomorphism), and relations among generators of G are determined by a matrix A. We reveal an association between the characteristic polynomial of A and the finite representation of the Cayley graph. After introducing an algorithm for the computation of the entropy dimension, the set of entropy dimensions is related to a collection of matrices in which the sum of each row of every matrix is bounded by the number of leaves of the graph. Furthermore, the algorithm extends to G having finitely many free-followers.