Search arXivSearch

arXiv · 1405.5491

Thompson groups for systems of groups, and their finiteness properties

Abstract

We describe a procedure for constructing a generalized Thompson group out of a family of groups that is equipped with what we call a cloning system. The previously known Thompson groups F, V, Vbr and Fbr arise from this procedure using, respectively, the systems of trivial groups, symmetric groups, braid groups and pure braid groups. We give new examples of families of groups that admit a cloning system and study how the finiteness properties of the resulting generalized Thompson group depend on those of the original groups. The main new examples here include upper triangular matrix groups, mock reflection groups, and loop braid groups. For generalized Thompson groups of upper triangular matrix groups over rings of S-integers of global function fields, we develop new methods for (dis-)proving finiteness properties, and show that the finiteness length of the generalized Thompson group is exactly the limit inferior of the finiteness lengths of the groups in the family.

Explore related subjects

Keep this discovery

BibTeXRIS

Stefan Witzel, Matthew C. B. Zaremsky. 2014-05-21. Thompson groups for systems of groups, and their finiteness properties. https://doi.org/10.4171/ggd%2F444

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