A simple approach to minimal substitution subshifts
A simple approach to minimal substitution subshifts
复制标题
一种实现最小替代换档的简单方法
DOI：
10.1016/j.topol.2019.04.009
复制
发表时间：
2019
影响因子：
0.6
通讯作者：
Takashi Shimomura
中科院分区：
文献类型：
--
作者：
Ayumu Hoshino;Jun'ichi Shiraishi;星野歩，白石潤一;Ayumu Hoshino and Jun'ichi Shiraishi;Ayumu Hoshino;星野歩;星野歩，白石潤一;星野歩，白石潤一;星野歩;星野歩;星野歩;Takashi Shimomura
Maloney和Rust（2016）引入了“驯服”的概念来简化最小替换子移位的研究。我们对这些置换引入了“l-重复性”的概念，并证明了这两个条件的结合可以证明置换子移位的极小性。作为一个应用，我们表明，以前的结果表明，一个容许的替代子移位是最小的当且仅当它是线性重复的是有效的所有替代子移位。上述一组条件可以通过有限数量的计算来检查，即在算法上。
Maloney and Rust (2016) introduced the concept of “tameness” to simplify the study of minimal substitution subshifts. We introduce the concept of “l-primitivity” for these substitutions, and show that the combination of these two conditions can characterise the minimality of substitution subshifts. As an application, we show that a previous result stating that an admissible substitution subshift is minimal if and only if it is linearly repetitive is valid for all substitution subshifts. The above set of conditions can be checked by a finite number of calculations, i.e. algorithmically.