SearcharxivSearch

arXiv · 2608.28348

The Twist Conjecture and the Isomorphism Problem for Coxeter groups

Abstract

We prove M\"uhlherr's Twist Conjecture: any two angle-compatible Coxeter generating sets of a Coxeter group differ by a finite sequence of elementary twists and a conjugation. Combined with earlier work of Howlett-M\"uhlherr and Marquis-M\"uhlherr, this completes the resolution of the Isomorphism Problem for Coxeter groups. A further consequence is that ${\rm Aut}(W)$ is finitely generated for every Coxeter group $W$, and there is an algorithm producing a finite set of generators for ${\rm Aut}(W)$ starting from any Coxeter matrix. Of the vast literature on the Twist Conjecture, we utilise only two results in an essential way: strong rigidity of $2$--spherical Coxeter systems, due to Caprace and M\"uhlherr, and the framework of markings and hierarchies developed by Caprace and Przytycki for the twist-rigid case. We also exploit in a fundamental way some soft ideas from JSJ theory and an observation of Mihalik-Tschantz on splittings of Coxeter groups. No form of AI was used in the writing of this manuscript, nor in the research that it presents.

Explore related subjects

Keep this discovery

BibTeXRIS

Elia Fioravanti. 2026-08-28. The Twist Conjecture and the Isomorphism Problem for Coxeter groups. https://arxiv.org/abs/2608.28348

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