Ordered trees and non-crossing partitions
From MaRDI portal
Publication:1103619
DOI10.1016/0012-365X(86)90120-2zbMath0646.05004OpenAlexW2094026978WikidataQ106202842 ScholiaQ106202842MaRDI QIDQ1103619
Nachum Dershowitz, Shmuel Zaks
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(86)90120-2
Related Items (14)
Parity reversing involutions on plane trees and 2-Motzkin paths ⋮ A generating tree approach to \(k\)-nonnesting partitions and permutations ⋮ Enumeration of connected Catalan objects by type ⋮ Simply Generated Non-Crossing Partitions ⋮ Enumerations of plane trees with multiple edges and Raney lattice paths ⋮ On noncrossing and nonnesting partitions of type \(D\) ⋮ Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind ⋮ A simple and direct derivation for the number of noncrossing partitions ⋮ Reduction of \(m\)-regular noncrossing partitions ⋮ Divided differences of inverse functions and partitions of a convex polygon ⋮ A partial order for the set of meanders ⋮ A bijection between ordered trees and bicoloured ordered trees ⋮ Generalized noncrossing partitions and combinatorics of Coxeter groups ⋮ Permutations, parenthesis words, and Schröder numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A correspondence between ordered trees and noncrossing partitions
- q-Catalan numbers
- Chain enumeration and non-crossing partitions
- Enumerations of ordered trees
- On the average oscillation of a stack
- 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
- On the number of certain lattice polygons
This page was built for publication: Ordered trees and non-crossing partitions
