Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1810.02667

On Brady's Classifying Spaces for Artin Groups of Finite Type

Valentin Braun
View original source ↗Read source document ↗Export metadata ↓

Abstract

This thesis takes Brady's construction of $K(\pi,1)$s for the braid groups as a starting point. It is widely known that this construction can - with the right ingredients - be generalized to Artin groups of finite type. Results of Bessis as well as Brady and Watt are used to establish the general construction for Artin groups of finite type. The non-crossing partition lattice in finite Coxeter groups is identified and used to generate the so called poset group. With the help of this poset group, which turns out to be isomorphic to the Artin group, a simplicial complex is constructed on which the poset group acts. It is shown that the complex itself is the universal cover of the $K(\pi,1)$ of the Artin group of finite type and the quotient under the action is the desired $K(\pi,1)$.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Valentin Braun. 2018-10-05. On Brady's Classifying Spaces for Artin Groups of Finite Type. https://arxiv.org/abs/1810.02667

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↗