Chain enumeration of k-divisible noncrossing partitions of classical types
classification
🧮 math.CO
keywords
divisiblenoncrossingpartitionsclassicaltypesarmstrongblockcertain
read the original 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 $180^\circ$ rotation in the cyclic representation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.