arXiv:0908.2641 [math.CO]AbstractReferencesReviewsResources
Chain enumeration of $k$-divisible noncrossing partitions of classical types
Published 2009-08-18, updated 2011-08-29Version 4
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.
Comments: 23 pages, 9 figures, final version
Journal: J. Combin. Theory Ser. A 118 (2011) 879-898
Categories: math.CO
Keywords: divisible noncrossing partitions, classical types, chain enumeration, armstrongs conjecture, zeta polynomial
Tags: journal article
Related articles: Most relevant | Search more
New interpretations for noncrossing partitions of classical types
The Catalan case of Armstrong's conjecture on simultaneous core partitions
Crossings and nestings in set partitions of classical types