Dyck paths with coloured ascents
From MaRDI portal
Publication:925029
DOI10.1016/j.ejc.2007.06.005zbMath1189.05011arXivmath/0701733OpenAlexW2003074303MaRDI QIDQ925029
Andrei Asinowski, Toufik Mansour
Publication date: 29 May 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0701733
Related Items
Unnamed Item ⋮ A decomposition algorithm for noncrossing trees ⋮ On rational Dyck paths and the enumeration of factor-free Dyck words ⋮ A bijection between two subfamilies of Motzkin paths ⋮ From Dyck paths to standard Young tableaux ⋮ Decomposition and merging algorithms for noncrossing forests ⋮ Enumeration of strings in Dyck paths: A bijective approach ⋮ CUNTZ–KRIEGER ALGEBRAS AND A GENERALIZATION OF CATALAN NUMBERS
Uses Software
Cites Work
- Analytic combinatorics of non-crossing configurations
- Enumeration of noncrossing trees on a circle
- Descents in noncrossing trees
- Bijections for ternary trees and non-crossing trees
- Statistics on non-crossing trees
- Diagonally convex directed polyominoes and even trees: A bijection and related issues
- From Motzkin to Catalan permutations
- Noncrossing trees and noncrossing graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
