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.
Recommendations
Cites work
- scientific article; zbMATH DE number 45266 (Why is no real title available?)
- scientific article; zbMATH DE number 3608062 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- Analytic combinatorics of non-crossing configurations
- Bijections for ternary trees and non-crossing trees
- Descents in noncrossing trees
- Diagonally convex directed polyominoes and even trees: A bijection and related issues
- Enumeration of noncrossing trees on a circle
- From Motzkin to Catalan permutations
- Noncrossing trees and noncrossing graphs
- Statistics on non-crossing trees
- The On-Line Encyclopedia of Integer Sequences
Cited in
(21)- scientific article; zbMATH DE number 7232750 (Why is no real title available?)
- On Enumeration of Dyck Paths with colored hills
- Decomposition and merging algorithms for noncrossing forests
- On rational Dyck paths and the enumeration of factor-free Dyck words
- Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\)
- scientific article; zbMATH DE number 7732138 (Why is no real title available?)
- From Dyck paths to standard Young tableaux
- Enumeration of strings in Dyck paths: A bijective approach
- Partial Dyck paths with Air Pockets
- Counting ascents in generalized Dyck paths
- Enumeration of colored Dyck paths via partial Bell polynomials
- A decomposition algorithm for noncrossing trees
- Bicoloured Dyck paths and the contact polynomial for \(n\) non-intersecting paths in a half-plane lattice
- Bijections between colored compositions, Dyck paths, and polygon partitions
- Enumeration of \(k\)-colored skew Dyck paths
- Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations
- Cuntz-Krieger algebras and a generalization of Catalan numbers
- Colored Motzkin paths of higher order
- A bijection between two subfamilies of Motzkin paths
- Bijections for Dyck paths with colored hills
- Short note on the number of 1-ascents in dispersed Dyck paths
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)
