Factorization problems in complex reflection groups

Abstract

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our approach is fully combinatorial. It gives results analogous to those of Jackson in the symmetric group and can be refined to encode a notion of cycle type. As one application of our results, we give a previously overlooked characterization of the poset of $W$-noncrossing partitions.

43 pages including a 9 page appendix, 6 figures, v2. minor changes including expanded introduction

Cited by in corpus (4)

• Hurwitz numbers for reflection groups II: Parabolic quasi-Coxeter elements
• Coincidences between intervals in two partial orders on complex reflection groups
• Hurwitz numbers for reflection groups III: Uniform formulas
• On products of permutations with the most uncontaminated cycles by designated labels