Dyck paths with coloured ascents
From MaRDI portal
Publication:925029
DOI10.1016/J.EJC.2007.06.005zbMATH Open1189.05011arXivmath/0701733OpenAlexW2003074303MaRDI QIDQ925029FDOQ925029
Authors: Andrei Asinowski, Toufik Mansour 
Publication date: 29 May 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon, etc. In some cases enumeration gives new expression for sequences enumerating these structures.
Full work available at URL: https://arxiv.org/abs/math/0701733
Recommendations
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Analytic combinatorics of non-crossing configurations
- Title not available (Why is that?)
- Enumeration of noncrossing trees on a circle
- From Motzkin to Catalan permutations
- Descents in noncrossing trees
- Bijections for ternary trees and non-crossing trees
- Statistics on non-crossing trees
- Noncrossing trees and noncrossing graphs
- Diagonally convex directed polyominoes and even trees: A bijection and related issues
- Title not available (Why is that?)
Cited In (21)
- On rational Dyck paths and the enumeration of factor-free Dyck words
- Bijections between colored compositions, Dyck paths, and polygon partitions
- Counting ascents in generalized Dyck paths
- Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations
- Bicoloured Dyck paths and the contact polynomial for \(n\) non-intersecting paths in a half-plane lattice
- On Enumeration of Dyck Paths with colored hills
- Enumeration of strings in Dyck paths: A bijective approach
- Bijections for Dyck paths with colored hills
- A bijection between two subfamilies of Motzkin paths
- Enumeration of \(k\)-colored skew Dyck paths
- A decomposition algorithm for noncrossing trees
- Title not available (Why is that?)
- Partial Dyck paths with Air Pockets
- From Dyck paths to standard Young tableaux
- Enumeration of colored Dyck paths via partial Bell polynomials
- Decomposition and merging algorithms for noncrossing forests
- Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\)
- Colored Motzkin paths of higher order
- Title not available (Why is that?)
- Cuntz-Krieger algebras and a generalization of Catalan numbers
- Short note on the number of 1-ascents in dispersed Dyck paths
Uses Software
This page was built for publication: Dyck paths with coloured ascents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925029)
