Dyck paths with coloured ascents

descriptionPublicationkeyboard_double_arrow_right Article , Preprint 01 Jul 2008Embargo end date: 01 Jan 2007 English Publisher:Elsevier BVJournal:European Journal of Combinatorics, volume 29, pages 1,262-1,279 (issn: 0195-6698,

Copyright policy )

Authors: Andrei Asinowski; Toufik Mansour;

doi: 10.1016/j.ejc.2007.06.005 , 10.48550/arxiv.math/0701733

arXiv: math/0701733

Dyck paths with coloured ascents

- Summary
- Subjects
- Metrics

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.

14 pages, 11 figures

Related Organizations

University of Haifa, Department of Mathematics
Israel
University of Haifa
Israel

Keywords

colored ascents, Exact enumeration problems, generating functions, 05A05, 05A15, Dyck paths, Theoretical Computer Science, lattice paths, Computational Theory and Mathematics, FOS: Mathematics, Mathematics - Combinatorics, Geometry and Topology, Combinatorics (math.CO)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average