Factorization problems in complex reflection groups
Factorization problems in complex reflection groups
复制标题
DOI:
10.4153/s0008414x2000022x
复制
发表时间:
2019-06
期刊:
影响因子:
--
通讯作者:
J. Lewis;A. Morales
中科院分区:
文献类型:
--
作者:
J. Lewis;A. Morales
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.