SearcharxivSearch

arXiv · 2306.13022

Springer categories for regular centralizers in well-generated complex braid groups

Abstract

In his proof of the K(pi,1) conjecture for complex reflection arrangements, Bessis defined Garside categories suitable for studying braid groups of centralizers of Springer regular elements in well-generated complex reflection groups. We provide a detailed study of these categories, which we call Springer categories. We describe in particular the conjugacy of braided reflections of regular centralizer in terms of the Garside structure of the associated Springer category. In so doing we obtain a pure Garside theoretic proof of a theorem of Digne, Marin and Michel on the center of finite index subgroups in complex braid groups in the case of a regular centralizer in a well-generated group. We also provide a "Hurwitz-like" presentation of Springer categories. To this aim we provide additional insights on noncrossing partitions in the infinite series. Lastly, we use this "Hurwitz-like" presentation, along with a generalized Reidemeister-Schreier method we introduce for groupoids, to deduce nice presentations of the complex braid group B(G31).

Explore related subjects

Keep this discovery

BibTeXRIS

Owen Garnier. 2023-06-22. Springer categories for regular centralizers in well-generated complex braid groups. https://arxiv.org/abs/2306.13022

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