We focus on the relationships between matching and subshift of finite type for intermediate -transformations ( 1), where and . We prove that if the kneading space is a subshift of finite type, then has matching. Moreover, each with 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 and with 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 has matching is dense on the fiber.

生成讲解博客的中文版本

生成AI智能校验的中文版本