Pages that link to "Item:Q1103619"
From MaRDI portal
The following pages link to Ordered trees and non-crossing partitions (Q1103619):
Displaying 19 items.
- A generating tree approach to \(k\)-nonnesting partitions and permutations (Q331488) (← links)
- Combinatorics of non-ambiguous trees (Q402584) (← links)
- Enumerations of plane trees with multiple edges and Raney lattice paths (Q465269) (← links)
- Noncrossing partitions and the shard intersection order (Q536561) (← links)
- Enumeration of connected Catalan objects by type (Q616392) (← links)
- On noncrossing and nonnesting partitions of type \(D\) (Q659657) (← links)
- Parity reversing involutions on plane trees and 2-Motzkin paths (Q819014) (← links)
- A bijection between ordered trees and bicoloured ordered trees (Q1024450) (← links)
- A partial order for the set of meanders (Q1272359) (← links)
- On trees and noncrossing partitions (Q1383385) (← links)
- Permutations, parenthesis words, and Schröder numbers (Q1584395) (← links)
- Reduction of \(m\)-regular noncrossing partitions (Q1765607) (← links)
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind (Q1972357) (← links)
- Divided differences of inverse functions and partitions of a convex polygon (Q3055071) (← links)
- Generalized noncrossing partitions and combinatorics of Coxeter groups (Q3656254) (← links)
- A simple and direct derivation for the number of noncrossing partitions (Q4387024) (← links)
- m-Noncrossing trees (Q4561478) (← links)
- Simply Generated Non-Crossing Partitions (Q5366962) (← links)
- (Q5502205) (← links)
