SearcharxivSearch

arXiv · 2401.07924

Minimal presentation, finite quotients and lower central series of cactus groups

Abstract

This article deals with the study of cactus groups from a combinatorial point of view. These groups have been gaining prominence lately in various domains of mathematics, amongst which are their relations with well-known groups such as braid groups, diagram groups, to name a few. We compute a minimal presentation for cactus groups in terms of generators and non-redundant relations. We also construct homomorphisms of these groups onto certain finite groups, which leads to results about finite quotients of cactus groups. More precisely, we prove that all (infinite) dihedral groups appear as quotients of cactus groups. We also investigate the lower central series and its consecutive quotients. While there are already known established similarities with braid groups, we deduce a considerable disparity between the two groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Hugo Chemin, Neha Nanda. 2024-01-15. Minimal presentation, finite quotients and lower central series of cactus groups. https://arxiv.org/abs/2401.07924

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