Multichains, non-crossing partitions and trees

DOI10.1016/0012-365X(82)90118-2zbMath0496.05007MaRDI QIDQ1170241

Paul H. Edelman

Publication date: 1982

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

zbMATH Keywords

enumeration of multichainsnon-crossing set partitionrooted labelled k-tree

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Related Items

Combinatorial statistics on non-crossing partitions ⋮ Two combinatorial statistics on Dyck paths ⋮ On \(q\)-analogues of partially ordered sets ⋮ The rank enumeration of certain parabolic non-crossing partitions ⋮ Noncommutative symmetric functions and Lagrange inversion. II: Noncrossing partitions and the Farahat-Higman algebra ⋮ Some properties of crossings and partitions ⋮ Exceptional and modern intervals of the Tamari lattice ⋮ On the structure of the lattice of noncrossing partitions ⋮ A recursion on maximal chains in the Tamari lattices ⋮ Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths ⋮ A basis for the non-crossing partition lattice top homology ⋮ Intervals in Catalan lattices and realizers of triangulations ⋮ Combinatorial statistics on alternating permutations ⋮ Generalized noncrossing partitions and combinatorics of Coxeter groups ⋮ Labeled binary trees, subarrangements of the Catalan arrangements, and Schur positivity ⋮ Chains in the lattice of noncrossing partitions ⋮ The enumeration of irreducible combinatorial objects ⋮ Multiplicative functions on the lattice of non-crossing partitions and free convolution

Cites Work

• Unnamed Item
• Unnamed Item
• Chain enumeration and non-crossing partitions
• Zeta polynomials and the Möbius function
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Étude et denombrement parallèles des partitions non-croisees d'un cycle et des decoupages d'un polygone convexe