SearcharxivSearch

arXiv · 2607.00181

Parabolic subgroups of Dyer groups

Abstract

For all Dyer groups, we find an algorithm to determine when two parabolic subgroups are conjugate. Given two conjugate standard parabolic subgroup, we fully describe the conjugating elements in terms of ribbons, showing that the ribbon conjecture holds true. In particular we give a description of the normaliser of a parabolic subgroup using ribbons. We prove the standardisation property for parabolic subgroups and deduce that an arbitrary intersection of parabolic subgroups is a parabolic subgroup.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

María Cumplido, Marina Salamero, Giovanni Sartori, Mireille Soergel. 2026-06-30. Parabolic subgroups of Dyer groups. https://arxiv.org/abs/2607.00181

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