Dyck paths with coloured ascents

Simple item page
dc.creatorAsinowski, Andrei
dc.creatorMansour, Toufik
dc.date2007-01-25
dc.date.accessioned2026-07-07T07:43:02Z
dc.date.available2026-07-07T07:43:02Z
dc.descriptionWe 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.
dc.description14 pages, 11 figures
dc.identifierhttps://arxiv.org/abs/math/0701733
dc.identifierhttp://arxiv.org/abs/math/0701733
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122666
dc.subjectCombinatorics
dc.subject05A05, 05A15
dc.titleDyck paths with coloured ascents
dc.typetext

Files

Collections

arXiv