Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.05751

Every Reflection Group Is Natural

Alex J Sutherland
View original source ↗Read source document ↗Export metadata ↓

Abstract

By a reflection group we mean an abstract group generated by nonidentity involutions. Knill proved that every reflection group of cardinality at most the continuum is natural, in the sense that some metric determines its group structure up to isomorphism among group structures whose right translations are isometries, and asked whether the cardinality hypothesis can be removed. We answer this question affirmatively. More precisely, every reflection group G admits a right invariant metric taking at most seven values for which the full isometry group is the right-regular action of G. The proof replaces distinct numerical labels on generators by a finite-valued encoding of a rigid graph on a well-ordered irredundant generating set.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Alex J Sutherland. 2026-09-04. Every Reflection Group Is Natural. https://arxiv.org/abs/2609.05751

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗