SearcharxivSearch

arXiv · 2601.09275

A note on the scatteredness of reflection orders

Abstract

In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in three equivalent ways: by the scatteredness of all reflection orders, by the existence of a reflection order of type $\omega + \omega^*$, and by a finiteness property of intervals determined by dihedral reflection subgroups. We also show that non-affineness can be characterized by the existence of order types $(\omega + \omega^*)[k]$ for arbitrarily large $k$, obtained by restricting any reflection order to a suitable subset. Our proofs exploit the geometry of projective roots, the isotropic cone, and universal reflection subgroups in infinite non-affine Coxeter groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Weijia Wang, Rui Wang. 2026-01-14. A note on the scatteredness of reflection orders. https://arxiv.org/abs/2601.09275

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