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...
Main Author: | Vivien Ripoll |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2011-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2955/pdf |
Similar Items
-
$m$-noncrossing partitions and $m$-clusters
by: Aslak Bakke Buan, et al.
Published: (2009-01-01) -
Bijections between noncrossing and nonnesting partitions for classical reflection groups
by: Alex Fink, et al.
Published: (2009-01-01) -
On the $H$-triangle of generalised nonnesting partitions
by: Marko Thiel
Published: (2014-01-01) -
Bijactions in Cataland
by: Nathan Williams
Published: (2014-01-01) -
The Sorting Order on a Coxeter Group
by: Drew Armstrong
Published: (2008-01-01)