SearcharxivSearch

arXiv · math/0602165

Centralizers of reflections and reflection-independence of Coxeter groups

Abstract

A Coxeter group W is called reflection independent if its reflections are uniquely determined by W only, independently on the choice of the generating set. We give a new sufficient condition for the reflection independence, and examine this condition for Coxeter groups in certain classes, possibly of infinite ranks. We also determine the finite irreducible components of another Coxeter group, that is a subgroup of W generated by the reflections centralizing a given generator of W. Determining such a subgroup makes our criterion efficient.

Explore related subjects

Keep this discovery

BibTeXRIS

Koji Nuida. 2006-02-08. Centralizers of reflections and reflection-independence of Coxeter groups. https://arxiv.org/abs/math/0602165

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