In this paper, we study the combinatorial properties ol words m chscrete dynamical systems from antisymmetric cubic maps. We also discuss the relationship of primitive kneading sequences of length n and period-doublin...In this paper, we study the combinatorial properties ol words m chscrete dynamical systems from antisymmetric cubic maps. We also discuss the relationship of primitive kneading sequences of length n and period-doubling kneading sequences of length 2n, and then determine the number of all kneading sequences of length n.展开更多
In this article, we solve some word equations originated from discrete dynamical systems related to antisymmetric cubic map. These equations emerge when we work with primitive and greatest words. In particular, we cha...In this article, we solve some word equations originated from discrete dynamical systems related to antisymmetric cubic map. These equations emerge when we work with primitive and greatest words. In particular, we characterize all the cases for which （β1β1） = （β2β） where β1 and β2 are the greatest words in 〈〈β31〉〉 and 〈〈β32〉〉 of M（n）.展开更多
文摘In this paper, we study the combinatorial properties ol words m chscrete dynamical systems from antisymmetric cubic maps. We also discuss the relationship of primitive kneading sequences of length n and period-doubling kneading sequences of length 2n, and then determine the number of all kneading sequences of length n.
文摘In this article, we solve some word equations originated from discrete dynamical systems related to antisymmetric cubic map. These equations emerge when we work with primitive and greatest words. In particular, we characterize all the cases for which （β1β1） = （β2β） where β1 and β2 are the greatest words in 〈〈β31〉〉 and 〈〈β32〉〉 of M（n）.
