SearcharxivSearch

arXiv · 2006.01466

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

Abstract

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}}, \sigma_{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 \sigma_{n}\rangle \hookrightarrow \mathrm{Aut}(X_n^{\mathbb{N}}, \sigma_{n}) \twoheadrightarrow \mathcal{L}_{n}$$ where here, $\langle \sigma_{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}}, \sigma_{n})$, and we demonstrate how to compute products using this new representation.

Explore related subjects

Keep this discovery

BibTeXRIS

James Belk, Collin Bleak, Peter J. Cameron, Feyishayo Olukoya. 2020-06-02. Automorphisms of shift spaces and the Higman-Thompson groups: the two-sided case. https://arxiv.org/abs/2006.01466

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR