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 ⊂ X is a subshift such that h(Y) < h(X), then the entropies of the SFTs Z for which Y ⊂ Z ⊂ X are dense in [h(Y), h(X)]. We also establish analogous results for sofic G-shifts.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.