Counting factorizations of Coxeter elements into products of reflections

Abstract

In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factorizations, which is expressed uniformly in terms of natural parameters of the group. In the case of factorizations of minimal length, we recover a formula due to P. Deligne, J. Tits and D. Zagier in the real case and to D. Bessis in the complex case. For the symmetric group, our formula specializes to a formula of D. M. Jackson.

38 pages, including 18 pages appendix. To appear in Journal of the London Mathematical Society. v3: minor changes and corrected references; v2: added extended discussion on the definition of Coxeter elements

References in corpus (1)

• Enumerative properties of generalized associahedra

Cited by in corpus (14)

• Reflection factorizations of Singer cycles
• Coxeter factorizations with generalized Jucys-Murphy weights and Matrix Tree theorems for reflection groups
• Counting chains in the noncrossing partition lattice via the W-Laplacian
• Hurwitz numbers for reflection groups II: Parabolic quasi-Coxeter elements
• The Hurwitz action in complex reflection groups
• Factorization problems in complex reflection groups
• Hurwitz numbers for reflection groups I: Generatingfunctionology
• Symmetric Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices
• Hurwitz Transitivity of Longer Reflection Factorizations in G4 and G5
• Lyashko-Looijenga morphisms and primitive factorizations of the Coxeter element
• Polynomial properties of Jack connection coefficients and generalization of a result by Dénes
• Rational Catalan Numbers for Complex Reflection Groups
• Hurwitz numbers for reflection groups III: Uniform formulas
• "Case-free" derivation for Weyl groups of the number of reflection factorisations of a Coxeter element