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

移位空间的自同构和Higman-Thompson群:双侧情况

Automorphisms of shift spaces and the Higman-Thompson groups: the two-sided case

James Belk, Collin Bleak, Peter J. Cameron, Feyishayo Olukoya

摘要:

在这篇文章中,我们进一步探讨了全移位空间的自同构群和Higman-Thompson群$\{G_{n,r}\}$的外自同构群之间的联系的性质。我们表明,商的(双边)移位动力系统$\mathrm{Aut}(X_n^{\mathbb{N}}, σ_{n})$的自同构群的中心嵌入作为一个特殊的子群$\mathcal{L}_{n}$的外部自同构群$\mathop{\mathrm{Out}}(G_{n,n-1})$的$G_{n,n-1}$。它遵循的结果瑞安,我们有以下的中央扩展:$$\langle σ_{n}\rangle \hookrightarrow \mathrm{Aut}(X_n^{\mathbb{N}}, σ_{n}) \twoheadrightarrow \mathcal{L}_{n}$$这里,$\langle σ_{n} \rangle \cong \mathbb{Z}$。我们证明了这个短的确切序列分裂当且仅当$n$是不是一个适当的权力,并在所有情况下,我们计算的2-上循环和2-coboundaries的扩展。我们还利用这个中心扩张证明了对于$1 \le r < n$,群$\mathop{\mathrm{Out}}(G_{n,r})$是无中心的,并且存在不可判定的序问题.注意,群$\mathop{\mathrm{Out}}(G_{n,n-1})$由有限变换器(自动机理论中出现的组合对象)组成,并且群$\mathcal{L}_{n}$的元素在$\mathop{\mathrm{Out}}(G_{n,n-1})$内容易通过简单的组合性质来表征。特别是,短的精确序列使我们能够确定一个新的和有效的纯组合表示元素的$\mathrm{Aut}(X_n^{\mathbb{N}}, σ_{n})$,我们演示了如何计算产品使用这种新的表示。

英文摘要:

In this article, we further explore the nature of a connection between the groups of automorphisms of full shift spaces and the groups of outer automorphisms of the Higman--Thompson groups $\{G_{n,r}\}$. We show that the quotient of the group of automorphisms of the (two-sided) shift dynamical system $\mathrm{Aut}(X_n^{\mathbb{N}}, σ_{n})$ by its centre embeds as a particular subgroup $\mathcal{L}_{n}$ of the outer automorphism group $\mathop{\mathrm{Out}}(G_{n,n-1})$ of $G_{n,n-1}$. It follows by a result of Ryan that we have the following central extension: $$\langle σ_{n}\rangle \hookrightarrow \mathrm{Aut}(X_n^{\mathbb{N}}, σ_{n}) \twoheadrightarrow \mathcal{L}_{n}$$ where here, $\langle σ_{n} \rangle \cong \mathbb{Z}$. We prove that this short exact sequence splits if and only if $n$ is not a proper power, and, in all cases, we compute the 2-cocycles and 2-coboundaries for the extension. We also use this central extension to prove that for $1 \le r < n$, the groups $\mathop{\mathrm{Out}}(G_{n,r})$ are centreless and have undecidable order problem. Note that the group $\mathop{\mathrm{Out}}(G_{n,n-1})$ consists of finite transducers (combinatorial objects arising in automata theory), and elements of the group $\mathcal{L}_{n}$ are easily characterised within $\mathop{\mathrm{Out}}(G_{n,n-1})$ by a simple combinatorial property. In particular, the short exact sequence allows us to determine a new and efficient purely combinatorial representation of elements of $\mathrm{Aut}(X_n^{\mathbb{N}}, σ_{n})$, and we demonstrate how to compute products using this new representation.

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

↑