Submaximal factorizations of a Coxeter element in complex reflection groups

When $W$ is a finite reflection group, the noncrossing partition lattice $NC(W)$ of type $W$ is a very rich combinatorial object, extending the notion of noncrossing partitions of an $n$-gon. A formula (for which the only known proofs are case-by-case) expresses the number of multichains of a given...

Full description

Bibliographic Details

Published in:	Discrete Mathematics & Theoretical Computer Science
Main Author:	Vivien Ripoll
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2011-01-01
Subjects:	complex reflection groups generalized noncrossing partition lattice generalized fuss-catalan numbers factorizations of a coxeter element [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/2955/pdf