Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2205.06383

Regular theory in complex braid groups

Owen Garnier
View original source ↗Read source document ↗Export metadata ↓

Abstract

In his seminal paper on complex reflection arrangements, Bessis introduces a Garside structure for the braid group of a well-generated irreducible complex reflection group. Using this Garside structure, he establishes a strong connection between regular elements in the reflection group, and roots of the "full twist" element of the pure braid group. He then suggests that it would be possible to extend the conclusion of this theorem to centralizers of regular elements in well-generated groups. In this paper we give a positive answer to this question and we show moreover that these results hold for an arbitrary reflection group.

Explore related subjects

math.GRmath.RT

Keep this discovery

BibTeXRIS

Owen Garnier. 2022-05-12. Regular theory in complex braid groups. https://arxiv.org/abs/2205.06383

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗