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

Computing automorphism groups of shifts using atypical equivalence classes

Ethan M. Coven, Anthony Quas, Reem Yassawi

英文摘要:

We study the automorphism group of an infinite minimal shift $(X,σ)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,σ)/\langle σ\rangle$ and also study the one-sided case. For a class of Toeplitz shifts, including the class of shifts defined by constant length primitive substitutions with a coincidence and with height one, we show that the two-sided automorphism group is a cyclic group. We next focus on shifts generated by primitive constant length substitutions. For these shifts, we give an algorithm that computes their two-sided automorphism group, As a corollary we describe how to compute the set of conjugacies between two such shifts.

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

↑