A bijection between 2-triangulations and pairs of non-crossing Dyck paths
| dc.creator | Elizalde, Sergi | |
| dc.date | 2006-10-06 | |
| dc.date.accessioned | 2026-07-07T07:28:48Z | |
| dc.date.available | 2026-07-07T07:28:48Z | |
| dc.description | 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. | |
| dc.description | 17 pages, 12 figures | |
| dc.identifier | https://arxiv.org/abs/math/0610235 | |
| dc.identifier | http://arxiv.org/abs/math/0610235 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/117870 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15 | |
| dc.title | A bijection between 2-triangulations and pairs of non-crossing Dyck paths | |
| dc.type | text |