Subshifts of finite type and matching for intermediate β-transformations
Abstract
We focus on the relationships between matching and subshift of finite type for intermediate β-transformations Tβ,α(x)=β x+α ( 1), where x∈[0,1] and (β,α) ∈ := \ (β, α) ∈ R2:β ∈ (1, 2) \; and \; 0 < α <2 - β\. We prove that if the kneading space β,α is a subshift of finite type, then Tβ,α has matching. Moreover, each (β,α)∈ with Tβ,α has matching corresponds to a matching interval, and there are at most countable different matching intervals on the fiber. Using combinatorial approach, we construct a pair of linearizable periodic kneading invariants and show that, for any ε>0 and (β,α)∈ with Tβ,α has matching, there exists (β,α) on the fiber with |α-α|<ε, such that β,α is a subshift of finite type. As a result, the set of (β,α) for which β,α is a subshift of finite type is dense on the fiber if and only if the set of (β,α) for which Tβ,α has matching is dense on the fiber.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.