SearcharxivSearch

arXiv · 2206.09471

Interval groups related to finite Coxeter groups, Part II

Abstract

We provide a complete description of the presentations of the interval groups related to quasi-Coxeter elements in finite Coxeter groups. In the simply laced cases, we show that each interval group is the quotient of the Artin group associated with the corresponding Carter diagram by the normal closure of a set of twisted cycle commutators, one for each 4-cycle of the diagram. Our techniques also reprove an analogous result for the Artin groups of finite Coxeter groups, which are interval groups corresponding to Coxeter elements. We also analyse the situation in the non-simply laced cases, where a new Garside structure is discovered. Furthermore, we obtain a complete classification of whether the interval group we consider is isomorphic or not to the related Artin group. Indeed, using methods of Tits, we prove that the interval groups of proper quasi-Coxeter elements are not isomorphic to the Artin groups of the same type, in the case of $D_n$ when $n$ is even or in any of the exceptional cases. In [BHNR22], we show using different methods that this result holds for type $D_n$ for all $n \geq 4$.

Explore related subjects

Keep this discovery

BibTeXRIS

Barbara Baumeister, Derek F. Holt, Georges Neaime, Sarah Rees. 2022-06-19. Interval groups related to finite Coxeter groups, Part II. https://arxiv.org/abs/2206.09471

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