Chain enumeration of k-divisible noncrossing partitions of classical types
From MaRDI portal
Chain enumeration of \(k\)-divisible noncrossing partitions of classical types
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{"u}ller. We also prove Armstrong's conjecture on the zeta polynomial of the poset of -divisible noncrossing partitions of type invariant under a rotation in the cyclic representation.
Recommendations
- scientific article; zbMATH DE number 6806833
- Enumeration of (k,2)-noncrossing partitions
- k-indivisible noncrossing partitions
- Chains in the lattice of noncrossing partitions
- On noncrossing and nonnesting partitions of type \(D\)
- A combinatorial bijection on \(k\)-noncrossing partitions
- Rational generating functions for enumerating chains of partitions
- New interpretations for noncrossing partitions of classical types
- The rank enumeration of certain parabolic non-crossing partitions
- A note on enumeration of noncrossing partitions.
Cites work
- Chain enumeration and non-crossing partitions
- Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- scientific article; zbMATH DE number 3219337 (Why is no real title available?)
- New interpretations for noncrossing partitions of classical types
- Non-crossing partition lattices in finite real reflection groups
- Non-crossing partitions for classical reflection groups
- Noncrossing Partitions for the GroupDn
- On noncrossing and nonnesting partitions for classical reflection groups
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- The dual braid monoid
Cited in
(9)- Chains in the lattice of noncrossing partitions
- Weyl group q-Kreweras numbers and cyclic sieving
- k-indivisible noncrossing partitions
- New interpretations for noncrossing partitions of classical types
- Evidence for parking conjectures
- Statistics of blocks in k-divisible non-crossing partitions
- scientific article; zbMATH DE number 6806833 (Why is no real title available?)
- Parking structures: Fuss analogs
- Two classes of posets with real-rooted chain polynomials
This page was built for publication: Chain enumeration of \(k\)-divisible noncrossing partitions of classical types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431251)