For let be the Sierpinski gasket generated by the iterated function system If , then the overlap region is nonempty, where is the convex hull of . In this paper we study the periodic codings of the univoque set More precisely, we determine for each the smallest base such that for any the set contains a sequence of smallest period . We show that each is a Perron number, and the sequence has infinitely many accumulation points. Furthermore, we show that if and only if is larger than in the Sharkovskii ordering; and the sequences decreasingly converge to the same limit point , respectively. In particular, we find that for all . Consequently, we prove that if contains a sequence of smallest period or , then contains a sequence of smallest period for any .

生成讲解博客的中文版本

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