English

Bounding reflection length in an affine Coxeter group

Combinatorics 2010-10-25 v2 Group Theory

Abstract

In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we prove that the reflection length function on an affine Coxeter group has a uniform upper bound. More precisely we prove that the reflection length function on an affine Coxeter group that naturally acts faithfully and cocompactly on Rn\R^n is bounded above by 2n2n and we also show that this bound is optimal. Conjecturally, spherical and affine Coxeter groups are the only Coxeter groups with a uniform bound on reflection length.

Keywords

Cite

@article{arxiv.1009.4918,
  title  = {Bounding reflection length in an affine Coxeter group},
  author = {Jon McCammond and T. Kyle Petersen},
  journal= {arXiv preprint arXiv:1009.4918},
  year   = {2010}
}

Comments

10 pages. Replaces earlier posting by second author. Paper is substantially reorganized and includes stronger results, including sharpness of the upper bound

R2 v1 2026-06-21T16:18:46.522Z