SearcharxivSearch

arXiv · 1511.02123

The infinite simple group V of Richard J. Thompson: presentations by permutations

Abstract

We show that one can naturally describe elements of R. Thompson's finitely presented infinite simple group $V$, known by Thompson to have a presentation with four generators and fourteen relations, as products of permutations analogous to transpositions. This perspective provides an intuitive explanation towards the simplicity of $V$ and also perhaps indicates a reason as to why it was one of the first discovered infinite finitely presented simple groups: it is (in some basic sense) a relative of the finite alternating groups. We find a natural infinite presentation for $V$ as a group generated by these "transpositions," which presentation bears comparison with Dehornoy's infinite presentation and which enables us to develop two small presentations for $V$: a human-interpretable presentation with three generators and eight relations, and a Tietze-derived presentation with two generators and seven relations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Collin Bleak, Martyn Quick. 2017-08-28. The infinite simple group V of Richard J. Thompson: presentations by permutations. https://doi.org/10.4171/ggd%2F433

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