The following pages link to Dyck paths with coloured ascents (Q925029):
Displaying 16 items.
- A decomposition algorithm for noncrossing trees (Q405065) (← links)
- Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations (Q604652) (← links)
- Enumeration of strings in Dyck paths: A bijective approach (Q1025920) (← links)
- Bicoloured Dyck paths and the contact polynomial for \(n\) non-intersecting paths in a half-plane lattice (Q1408540) (← links)
- On rational Dyck paths and the enumeration of factor-free Dyck words (Q1752582) (← links)
- Decomposition and merging algorithms for noncrossing forests (Q2062886) (← links)
- From Dyck paths to standard Young tableaux (Q2307692) (← links)
- Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\) (Q2684899) (← links)
- Cuntz-Krieger algebras and a generalization of Catalan numbers (Q2854051) (← links)
- (Q3303410) (← links)
- A bijection between two subfamilies of Motzkin paths (Q3390798) (← links)
- Enumeration of k-colored skew Dyck path (Q3462873) (← links)
- On Enumeration of Dyck Paths with colored hills (Q4612111) (← links)
- Partial Dyck paths with Air Pockets (Q5042409) (← links)
- Bijections for Dyck paths with colored hills (Q6098007) (← links)
- (Q6136022) (← links)
