A refined count of coxeter element reflection factorizations

Elise Delmas, Thomas Hameister, Victor Reiner

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish (US)
JournalElectronic Journal of Combinatorics
Volume25
Issue number1
DOIs
StatePublished - Feb 16 2018

Bibliographical note

Funding Information:
∗Supported by NSF grant DMS-1601961. †Supported by NSF grant DMS-1148634. ‡Supported by NSF grant DMS-1601961.

Keywords

  • Coxeter element
  • Factorization
  • Reflection group
  • Well-generated

Fingerprint Dive into the research topics of 'A refined count of coxeter element reflection factorizations'. Together they form a unique fingerprint.

Cite this