Search arXivSearch

arXiv · 2103.06663

Graph and wreath products in topological full groups of full shifts

Abstract

We prove that the topological full group $[[X]]$ of a two-sided full shift $X = \Sigma^{\mathbb{Z}}$ contains every right-angled Artin group (also called a graph group). More generally, we show that the family of subgroups with "linear look-ahead" is closed under graph products. We show that the lamplighter group $\mathbb{Z}_2 \wr \mathbb{Z}$ embeds in $[[X]]$, and conjecture that it does not embed in $[[X]]$ with linear look-ahead. Generalizing the lamplighter group, we show that whenever $G$ acts with "unique moves" (or at least "move-$A$ithfully"), we have $A \wr G \leq [[X]]$ for finite abelian groups $A$. We show that free products of finite and cyclic groups act with unique moves. We show that $\mathbb{Z}^2$ does not admit move-$A$ithful actions, and conjecture that $\mathbb{Z}_2 \wr \mathbb{Z}^2$ does not embed in $[[X]]$ at all. We show that topological full groups of all infinite nonwandering sofic shifts have the same subgroups, and that this set of groups is closed under commensurability. The group $[[X]]$ embeds in the higher-dimensional Thompson group $2$V, so it follows that $2$V contains all RAAGs, refuting a conjecture of Belk, Bleak and Matucci.

Explore related subjects

Keep this discovery

BibTeXRIS

Ville Salo. 2021-03-11. Graph and wreath products in topological full groups of full shifts. https://arxiv.org/abs/2103.06663

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