SearcharxivSearch

arXiv · 2103.15505

Veelike actions and the MCG of a mixing SFT

Abstract

We embed Thompson's group $V$ in the mapping class group of a mixing subshift of finite type. Question~6.3 in [Boyle-Chuysurichay, 17] asks whether these mapping class groups are sofic. Our result suggests that this question is difficult to solve at present (at least for some mixing SFTs), since a resolution of it in either direction would solve an open problem in geometric group theory. More generally, we define the notion of a ``veelike action'', and prove that whenever a group acts veelike on a language, it embeds in the mapping class group of some subshift. We show that Thompson's $V$ acts veelike on a locally testable language, and thus it embeds in the mapping class group of a mixing SFT. A two-sided variant of the argument works for the Brin-Thompson group $2V$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ville Salo. 2021-03-29. Veelike actions and the MCG of a mixing SFT. https://arxiv.org/abs/2103.15505

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