Dyck paths with coloured ascents

Andrei Asinowski, Toufik Mansour

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)1262-1279
Number of pages18
JournalEuropean Journal of Combinatorics
Issue number5
StatePublished - Jul 2008

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Dyck paths with coloured ascents'. Together they form a unique fingerprint.

Cite this