Chain enumeration of k-divisible noncrossing partitions of classical types

From MaRDI portal
Chain enumeration of \(k\)-divisible noncrossing partitions of classical types



Abstract: We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the block size due to Krattenthaler and M{"u}ller. We also prove Armstrong's conjecture on the zeta polynomial of the poset of k-divisible noncrossing partitions of type A invariant under a 180circ rotation in the cyclic representation.












This page was built for publication: Chain enumeration of \(k\)-divisible noncrossing partitions of classical types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431251)