$β$的跟随、前趋和扩展集序列-移位
Follower, Predecessor, and Extender Set Sequences of $β$-Shifts
摘要:
给定一维移位$X$,令$|F_X(n)|$是$X$中长度为$n$的字的跟随者集合的数目,并且$|P_X(n)|$是$X$中长度为$n$的字的前导者集合的数目。我们称序列$\{|F_X(n)|\}_{n \in \mathbb{N}}$为移位$X$的跟随集序列,而$\{|P_X(n)|\}_{n \in \mathbb{N}}$为移位$X$的前导集序列。扩张集是跟随集的推广,我们定义扩张集序列类似。在本文中,我们研究可实现的差异,在限制行为的追随者,前任和扩展集序列。这是通过经典的$β$移位来完成的。我们发现,以下一组序列的$β$移位必须增长最多线性$n$,而前任和扩展集序列可能会表现出指数增长性率在$n$,根据选择的$β$。
英文摘要:
Given a one-dimensional shift $X$, let $|F_X(n)|$ be the number of follower sets of words of length $n$ in $X$, and $|P_X(n)|$ be the number of predecessor sets of words of length $n$ in $X$. We call the sequence $\{|F_X(n)|\}_{n \in \mathbb{N}}$ the follower set sequence of the shift $X$, and $\{|P_X(n)|\}_{n \in \mathbb{N}}$ the predecessor set sequence of the shift $X$. Extender sets are a generalization of follower sets, and we define the extender set sequence similarly. In this paper, we examine achievable differences in limiting behavior of follower, predecessor, and extender set sequences. This is done through the classical $β$-shifts. We show that the follower set sequences of $β$-shifts must grow at most linearly in $n$, while the predecessor and extender set sequences may demonstrate exponential growth rate in $n$, depending on choice of $β$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。