arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1707.01259math.DS
收藏

求替换极小子移位的一种简单方法

A simple approach to substitution minimal subshifts

Takashi Shimomura

摘要:

在置换极小子移位的研究中,一些复杂的琐碎性阻碍了简单而通用的方法。最近,Maloney和Rust引入了“驯服”一词,简化了研究。我们引入另一个术语“$l$ -原语”的替代,并表明,这两个条件的组合可以表征极小的替代子移位。我们将证明所有的替换最小子移位都可以由满足这两个条件的替换生成;相反,所有满足这两个条件的替换总是生成最小子移位。作为一个应用,我们证明了Damanik和Lenz的结果,一个容许的替代子移位是最小的当且仅当它是线性重复的是有效的所有替代子移位。上述条件集可以通过有限计算(算法)来检查。

英文摘要:

In the study of substitution minimal subshifts, some complicated trivialities have hindered simple and general approaches. Recently, Maloney and Rust introduced the term "tame," simplifying the study. We introduce another term "$l$-primitive" for the substitutions and show that the combination of these two conditions can characterize the minimality of substitution subshifts. We shall show that all substitution minimal subshifts can be generated by substitutions that satisfy both conditions; conversely, all substitutions that satisfy the two conditions always generate minimal subshifts. As an application, we show that the result by Damanik and Lenz 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 finite calculations (algorithms).

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

↑