Dyck paths with coloured ascents

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
14 pages, 11 figures

Keywords

Combinatorics, 05A05, 05A15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/122666

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0701733
 http://arxiv.org/abs/math/0701733

Collections

arXiv