arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.13689math.DS
收藏

有限字母秩的$\mathcal{S}$ -进子移位的符号因子

Symbolic factors of $\mathcal{S}$-adic subshifts of finite alphabet rank

Bastián Espinoza

摘要:

本文研究了符号({ \em})的几个方面,即子移位)因子的有限字母秩的$\mathcal{S}$ -进子移位。首先,我们解决了文献[DDPM 20]中提出的关于$\mathcal{S}$ -adic子移位的符号因子的拓扑秩的问题,并证明了这个秩至多是可拓系统的秩,改进了文献[E20]和[GH 2020]的结果.作为我们的方法的结果,我们证明了有限拓扑秩系统是结合的。其次,我们研究了有限字母秩的最小$\mathcal{S}$ -adic子移位之间的因子映射$π\colon(X,T)\to(Y,S)$的纤维$π^{-1}(y)$的结构,并证明了它们对$Y$的剩余子集中的所有$y$具有相同的有限基数。最后,证明了有限拓扑秩的固定子移位的符号因子个数(直到共轭)是有限的,从而推广了Durand关于线性递归子移位的相似定理[D 00].

英文摘要:

This paper studies several aspects of symbolic ({\em i.e.}\ subshift) factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of $\mathcal{S}$-adic subshifts and prove that this rank is at most the one of the extension system, improving results from [E20] and [GH2020]. As a consequence of our methods, we prove that finite topological rank systems are coalescent. Second, we investigate the structure of fibers $π^{-1}(y)$ of factor maps $π\colon(X,T)\to(Y,S)$ between minimal $\mathcal{S}$-adic subshifts of finite alphabet rank and show that they have the same finite cardinality for all $y$ in a residual subset of $Y$. Finally, we prove that the number of symbolic factors (up to conjugacy) of a fixed subshift of finite topological rank is finite, thus extending Durand's similar theorem on linearly recurrent subshifts [D00].

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

↑