SearcharxivSearch

arXiv · 1410.8726

Some isomorphism results for Thompson like groups $V_n(G)$

Abstract

We consider a class of groups $V_n(G)$ which are supergroups of the Higman-Thompson groups $V_n$. These groups fit in a framework of Elizabeth Scott for generating infinite virtually simple groups, and the groups we study in particular are initially introduced by Farley and Hughes. The group $V_n(G)$ is the result one obtains by taking the $V_n$ generators and adding a tree automorphism for each generator of a subgroup $G$ of the symmetric group on $n$ letters, where the new generators each permute the child leaves of a specific vertex $α$ of the infinite rooted $n$-ary tree according to the permutation they represent, and then they iterate this permutation again at each vertex which is a descendent of $α$. Farley and Hughes show that $V_n(G)$ is not isomorphic to $V_n$ when $G$ fails to act freely on the points $\{1,2,...,n\}$, and expect further non-isomorphism results in the other cases. We show the perhaps surprising result that if $G$ does act freely, then $V_n(G)\cong V_n$. We also generalise these results and produce some examples of even more isomorphisms amongst groups in the family $V_n(G)$. Essential tools in the above work are a study of the dynamics of the action of elements of $V_n(G)$ on Cantor space, Rubin's Theorem, and transducers from Grigorchuk, Nekrashevych, and Suschanskiĭ's rational group on the $n$-ary alphabet.

Explore related subjects

Keep this discovery

BibTeXRIS

Collin Bleak, Casey Donoven, Julius Jonušas. 2014-12-17. Some isomorphism results for Thompson like groups $V_n(G)$. https://arxiv.org/abs/1410.8726

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