Dyck paths with coloured ascents

Details Dyck paths with coloured ascents Dyck paths with coloured ascents

2007-01-25

arxiv.org/abs/math/0701733v1

Mathematics

Combinatorics

14 pages, 11 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Dyck paths with coloured ascents does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dyck paths with coloured ascents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dyck paths with coloured ascents will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329152