Subshifts of finite type which have completely positive entropy

Abstract

Domino tilings have been studied extensively for both their statistical properties and their dynamical properties. We construct a subshift of finite type using matching rules for several types of dominos. We combine the previous results about domino tilings to show that our subshift of finite type has a measure of maximal entropy with which the subshift has completely positive entropy but is not isomorphic to a Bernoulli shift.

28 pages

References in corpus (3)

• Local statistics of lattice dimers
• The Laplacian and $\bar{\partial }$ operators on critical planar graphs
• Uniqueness of maximal entropy measure on essential spanning forests

Cited by in corpus (1)

• Examples in the entropy theory of countable group actions