Special Session 28: 

The entropy of shifts of finite type on Cayley graph

Jung-Chao Ban
National Dong Hwa University
Taiwan
Co-Author(s):    Chih-Hung Chang
Abstract:
In this paper, we provide the effective method to compute the entropy of shifts of finite type (SFT) which is defi ned on the Cayley graph. Moreover, we present an algebraic characterization of their entropies, which shows that they are equal to the logarithm of the Perron numbers. These results extend the classical results of Z^1 SFTs, and SFTs on Cayley trees, to Cayley graphs.