Bounding reflection length in an affine Coxeter group.

From MaRDI portal
Publication:644697

DOI10.1007/S10801-011-0289-1zbMATH Open1229.20034arXiv1009.4918OpenAlexW2055525593MaRDI QIDQ644697FDOQ644697

Jon McCammond, T. Kyle Petersen

Publication date: 7 November 2011

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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 is bounded above by 2n 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.


Full work available at URL: https://arxiv.org/abs/1009.4918





Cites Work


Cited In (14)






This page was built for publication: Bounding reflection length in an affine Coxeter group.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644697)