Chains in the lattice of noncrossing partitions

DOI10.1016/0012-365X(94)90257-7zbMath0795.05013MaRDI QIDQ1318847

Rodica Simion, Paul H. Edelman

Publication date: 4 April 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

latticenoncrossing partitionspermutation statisticMöbius inversion formulas

Mathematics Subject Classification ID

Partitions of sets (05A18)

Related Items (14)

Combinatorial statistics on non-crossing partitions ⋮ The homology of partitions with an even number of blocks ⋮ The pruning-grafting lattice of binary trees ⋮ On \(q\)-analogues of partially ordered sets ⋮ The rank enumeration of certain parabolic non-crossing partitions ⋮ The phagocyte lattice of Dyck words ⋮ Non-crossing partitions for classical reflection groups ⋮ A simple and direct derivation for the number of noncrossing partitions ⋮ On the growth of the Möbius function of permutations ⋮ A basis for the non-crossing partition lattice top homology ⋮ Polynomials, meanders, and paths in the lattice of noncrossing partitions ⋮ Nested Sets of Pairs ⋮ Combinatorial statistics on alternating permutations ⋮ Multiplicative functions on the lattice of non-crossing partitions and free convolution

Cites Work

• Multichains, non-crossing partitions and trees
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Shellable and Cohen-Macaulay Partially Ordered Sets
• A higher invariant for matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chains in the lattice of noncrossing partitions