Search arXivSearch

arXiv · 2103.15539

Thompson's $V$ in MCG of mixing SFT by PW-linear homeos

Abstract

In a recent paper, we showed that groups admitting "veelike actions" on a finite language embed in mapping class groups of certain two-sided subshifts. In this note, we illustrate this theorem for the embedding of Thompson's $V$ by exhibiting the piecewise linear local rules for the embedding. These turn out to split the embedding into the mapping class group, showing that $V$ even embeds in the mapping class group by homeomorphisms.

Explore related subjects

Keep this discovery

BibTeXRIS

Ville Salo. 2021-03-29. Thompson's $V$ in MCG of mixing SFT by PW-linear homeos. https://arxiv.org/abs/2103.15539

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