Dyck paths with coloured ascents
Combinatorics
2007-05-23 v1
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.
Cite
@article{arxiv.math/0701733,
title = {Dyck paths with coloured ascents},
author = {Andrei Asinowski and Toufik Mansour},
journal= {arXiv preprint arXiv:math/0701733},
year = {2007}
}
Comments
14 pages, 11 figures