Pages that link to "Item:Q331488"
From MaRDI portal
The following pages link to A generating tree approach to \(k\)-nonnesting partitions and permutations (Q331488):
Displaying 9 items.
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Tableau sequences, open diagrams, and Baxter families (Q739059) (← links)
- Pattern avoidance in matchings and partitions (Q1953480) (← links)
- A combinatorial bijection on \(k\)-noncrossing partitions (Q2095116) (← links)
- A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions (Q2174564) (← links)
- Pattern-avoiding inversion sequences and open partition diagrams (Q2202026) (← links)
- Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences (Q2315433) (← links)
- (Q5110962) (← links)
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels (Q6074662) (← links)