Subsystem entropies of shifts of finite type and sofic shifts on countable amenable groups

Abstract

In this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group $G$, if $X$ is a $G$-SFT with positive topological entropy $h(X)>0$, then the entropies of the SFT subsystems of $X$ are dense in the interval $[0,h(X)]$. In fact, we prove a "relative" version of the same result: if $X$ is a $G$-SFT and $Y\subset X$ is a subshift such that $h(Y)<h(X)$, then the entropies of the SFTs $Z$ for which $Y\subset Z\subset X$ are dense in $[h(Y),h(X)]$. We also establish analogous results for sofic $G$-shifts.

arXiv comment32 pages, 4 figures

References in corpus (5)

• A Characterization of the Entropies of Multidimensional Shifts of Finite Type
• Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type
• Symbolic dynamics on amenable groups: the entropy of generic shifts
• A generalization of the simulation theorem for semidirect products
• On the entropies of subshifts of finite type on countable amenable groups

Cited by in corpus (2)

• An embedding theorem for subshifts over amenable groups with the comparison property
• Homomorphisms from aperiodic subshifts to subshifts with the finite extension property