A bijection between 2-triangulations and pairs of non-crossing Dyck paths

Details A bijection between 2-triangulations and pairs of non-crossing Dyck paths A bijection between 2-triangulations and pairs of non-crossing Dyck paths

2006-10-06

arxiv.org/abs/math/0610235v1

Mathematics

Combinatorics

17 pages, 12 figures

Scientific paper

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length 2(n-4). This solves the problem of finding a bijective proof of a result of Jonsson for the case k=2. We obtain the bijection by constructing isomorphic generating trees for the sets of 2-triangulations and pairs of non-crossing Dyck paths.

Affiliated with

Also associated with

No associations

Rating

A bijection between 2-triangulations and pairs of non-crossing Dyck paths 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 A bijection between 2-triangulations and pairs of non-crossing Dyck paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A bijection between 2-triangulations and pairs of non-crossing Dyck paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-489670