arXiv Analytics

Sign in

arXiv:1708.06292 [math.CO]AbstractReferencesReviewsResources

A refined count of Coxeter element factorizations

Elise delMas, Thomas Hameister, Victor Reiner

Published 2017-08-21Version 1

For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections used from each orbit of hyperplanes. The proof is case-by-case via the classification of well-generated groups. It implies a new expression for the Coxeter number, expressed via data coming from a hyperplane orbit; a case-free proof of this due to J. Michel is included.

Related articles: Most relevant | Search more
arXiv:math/0701792 [math.CO] (Published 2007-01-27, updated 2009-03-30)
Cyclic sieving of noncrossing partitions for complex reflection groups
arXiv:1001.0030 [math.CO] (Published 2009-12-30, updated 2012-02-28)
Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type - the details
arXiv:1211.2789 [math.CO] (Published 2012-11-12, updated 2014-09-15)
Counting factorizations of Coxeter elements into products of reflections