arXiv Analytics

Sign in

arXiv:0908.2641 [math.CO]AbstractReferencesReviewsResources

Chain enumeration of $k$-divisible noncrossing partitions of classical types

Jang Soo Kim

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
Subjects: 05A15, 05E15
Related articles: Most relevant | Search more
arXiv:0910.2036 [math.CO] (Published 2009-10-11, updated 2011-08-29)
New interpretations for noncrossing partitions of classical types
arXiv:1312.4352 [math.CO] (Published 2013-12-16, updated 2014-12-23)
The Catalan case of Armstrong's conjecture on simultaneous core partitions
arXiv:0904.1097 [math.CO] (Published 2009-04-07, updated 2009-04-09)
Crossings and nestings in set partitions of classical types