SearcharxivSearch

arXiv · 2410.13544

Subgroups of braid groups generated by Birman-Ko-Lee generators

Abstract

We define a Young subgroup of the braid group as a subgroup generated by an arbitrary subset of the Birman-Ko-Lee generators. We give an intrinsic description of such subgroups which yields, in particular, an easy criterion to decide membership. We also give an algorithm to write an element of a Young subgroup as a product of the generators. Our methods are based on analyzing the Hurwitz action on tuples over free groups via a diagrammatic approach.

Explore related subjects

Keep this discovery

BibTeXRIS

Anya Nordskova, Michel Van den Bergh. 2024-10-17. Subgroups of braid groups generated by Birman-Ko-Lee generators. https://arxiv.org/abs/2410.13544

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