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.
Cyclic sieving of noncrossing partitions for complex reflection groups
Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type - the details
Counting factorizations of Coxeter elements into products of reflections
![QR code for arXiv:1708.06292 [math.CO]](http://oss.arxitics.com/images/favicon.svg)