arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1509.01273math.DS
收藏

跟随集数目缓慢增长的子移位

Subshifts with Slowly Growing Numbers of Follower Sets

Thomas French, Nic Ormes, Ronnie Pavlov

摘要:

对于任何子移位,将$F_X(n)$定义为$X$中长度为$n$的字的不同跟随者集合的集合。基于第二和第三作者的一个类似结果,我们猜想:如果存在一个$n$,它的$|F_X(n)| \leq n$,则$X$是sofic的.本文证明了与此猜想有关的几个结果,包括对$n \leq 3$的验证,证明了此猜想对一大类编码子移位成立,并证明了如果存在$n$,则$X$是sofic的.

英文摘要:

For any subshift, define $F_X(n)$ to be the collection of distinct follower sets of words of length $n$ in $X$. Based on a similar result of the second and third authors, we conjecture that if there exists an $n$ for which $|F_X(n)| \leq n$, then $X$ is sofic. In this paper, we prove several results related to this conjecture, including verifying it for $n \leq 3$, proving that the conjecture is true for a large class of coded subshifts, and showing that if there exists $n$ for which $|F_X(n)| \leq \log_2(n+1)$, then $X$ is sofic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑