Chain enumeration of κ-divisible noncrossing partitions of classical types

Research output: Contribution to conferencePaperpeer-review

Abstract

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

Original languageEnglish
Pages809-820
Number of pages12
StatePublished - 2010
Externally publishedYes
Event22nd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'10 - San Francisco, CA, United States
Duration: 2 Aug 20106 Aug 2010

Conference

Conference22nd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'10
Country/TerritoryUnited States
CitySan Francisco, CA
Period2/08/106/08/10

Keywords

  • Chain enumeration
  • Noncrossing partitions

Fingerprint

Dive into the research topics of 'Chain enumeration of κ-divisible noncrossing partitions of classical types'. Together they form a unique fingerprint.

Cite this