Extender sets and measures of maximal entropy for subshifts
arXiv:1808.09486 · doi:10.1112/jlms.12252
Abstract
We prove inequalities relating the measures of maximal entropy of two patterns u,v where the extender set of u is contained in the extender set of v. Our main results are two generalizations of a Theorem of Meyerovitch; the first applies to all such v,w when G=Z, and the second to v,w with the same shape and any countable amenable finitely generated torsion-free G. As a consequence of our results we give new and simpler proofs of several facts about synchronizing subshifts and we answer a question of Climenhaga.
accepted in the Journal of the London Mathematical Society
References in corpus (1)
Cited by in corpus (8)
- On the specification property and synchronisation of unique -expansions
- Measures of maximal entropy of bounded density shifts
- Bounds for Equilibrium States on Amenable Group Subshifts
- Markov Capacity for Factor Codes with an Unambiguous Symbol
- On subshifts with slow forbidden word growth
- Shifts of Finite Type Obtained by Forbidding a Single Pattern
- A classification of intrinsic ergodicity for recognisable random substitution systems
- Distribution of integers with digit restrictions via Markov chains