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

DOI10.1016/j.jcta.2010.10.009zbMath1232.05018arXiv0908.2641MaRDI QIDQ2431251

Jang Soo Kim

Publication date: 11 April 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.2641

zbMATH Keywords

multichainszeta polynomialschain enumeration\(k\)-divisible noncrossing partitionsnoncrossing partitions of finite Coxeter groups

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Related Items (4)

Evidence for parking conjectures ⋮ New interpretations for noncrossing partitions of classical types ⋮ Weyl group \(q\)-Kreweras numbers and cyclic sieving ⋮ Parking structures: Fuss analogs

Cites Work

• Unnamed Item
• Chain enumeration and non-crossing partitions
• On noncrossing and nonnesting partitions for classical reflection groups
• Non-crossing partitions for classical reflection groups
• New interpretations for noncrossing partitions of classical types
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• The dual braid monoid
• Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Noncrossing Partitions for the GroupDn
• Non-crossing partition lattices in finite real reflection groups

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