Generating functionology
Enumeration of noncrossing trees on a circle
Proceedings of the 7th conference on Formal power series and algebraic combinatorics
Analytic combinatorics of non-crossing configurations
Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
From Motzkin to Catalan permutations
Discrete Mathematics
Bijection for ternary trees and non-crossing trees
Discrete Mathematics
| Hi-index | 0.00 |
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, 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.