A correspondence between ordered trees and noncrossing partitions
From MaRDI portal
Publication:1050987
DOI10.1016/0012-365X(83)90255-8zbMath0514.05008MaRDI QIDQ1050987
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)
Related Items
Parity reversing involutions on plane trees and 2-Motzkin paths, The Catalan combinatorics of the hereditary artin algebras, Some remarks on Catalan families, Ordered trees and non-crossing partitions, Catalan structures and Catalan pairs, Simply Generated Non-Crossing Partitions, Catalan pairs: a relational-theoretic approach to Catalan numbers, Generating trees withnnodes andmleaves, Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind, Reduction of \(m\)-regular noncrossing partitions, Lattice paths with given number of turns and semimodules over numerical semigroups, Ascending runs in permutations and valued Dyck paths, A bijection between ordered trees and bicoloured ordered trees, Permutations, parenthesis words, and Schröder numbers, Catalan, Motzkin, and Riordan numbers, Dyck path enumeration
Cites Work
