A combinatorial bijection on \(k\)-noncrossing partitions
From MaRDI portal
Publication:2095116
DOI10.1007/s00493-021-4262-xOpenAlexW2945953129MaRDI QIDQ2095116
Publication date: 9 November 2022
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.10526
Related Items
Cites Work
- Unnamed Item
- A generating tree approach to \(k\)-nonnesting partitions and permutations
- Counting Dyck paths by area and rank
- On 1212-avoiding restricted growth functions
- On partitions avoiding 3-crossings
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- Faces of generalized permutohedra
- Some identities on the Catalan, Motzkin and Schröder numbers
- Restricted plane tree representations of four Motzkin-Catalan equations
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- A bijection between ordered trees and 2-Motzkin paths and its many consequences
- A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Ascent sequences and 3-nonnesting set partitions
- Crossings and nestings of matchings and partitions
- Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
- Eulerian Numbers
- Motzkin numbers