SearcharxivSearch

arXiv · 2606.21104

On the Weak Right Order of a Right-Angled Coxeter System

Abstract

Let $ (W,S)$ be a Coxeter system, and let $ w\in W$. Let $ [1,w] := \{ x\in W \mid x \leq_{R} w \} $ where $ \leq_{R}$ denotes the weak right order of $ (W,S)$. The element $ w$ is said to have the \emph{ancestor property} if there is a unique non-trivial involution of maximal length in the set $ [1,w]$. The ancestor property was first defined by Hart and Rowley in \cite{hart2025noteinvolutionprefixescoxeter} where they conjectured that all non-identity elements in a finite Coxeter system have the ancestor property. In an arbitrary Coxeter system $(W,S)$, we show that the ancestor property holds for any non-identity fully commutative element (see \cite{stembridge1996fully} for the definition of a fully commutative element). In particular, since any element of a right-angled Coxeter system is fully commutative, we show that the ancestor property holds for all non-identity elements of a right-angled Coxeter system. Lastly, we also provide an axiomatization of right-angled Coxeter systems as reflection systems with a reflection cocycle that obeys a certain property called the \emph{meet intersection condition}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Harrison Gimenez. 2026-06-19. On the Weak Right Order of a Right-Angled Coxeter System. https://arxiv.org/abs/2606.21104

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