A bijection between 2-triangulations and pairs of non-crossing Dyck paths
A bijection between 2-triangulations and pairs of non-crossing Dyck paths
复制标题
2-三角剖分和成对非交叉 Dyck 路径之间的双射
DOI:
10.1016/j.jcta.2007.03.002
复制
发表时间:
2006
期刊:
影响因子:
--
通讯作者:
Sergi Elizalde
中科院分区:
文献类型:
--
作者:
Sergi Elizalde
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.