Skip to Main content Skip to Navigation
Conference papers

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

Abstract : A $k$-triangulation of the $n$-gon is a maximal set of diagonals of the $n$-gon containing no subset of $k+1$ mutually crossing diagonals. The number of $k$-triangulations of the $n$-gon, determined by Jakob Jonsson, is equal to a $k \times k$ Hankel determinant of Catalan numbers. This determinant is also equal to the number of $k$ non-crossing Dyck paths of semi-length $n-2k$. This brings up the problem of finding a combinatorial bijection between these two sets. In FPSAC 2007, Elizalde presented such a bijection for the case $k=2$. We construct another bijection for this case that is stronger and simpler that Elizalde's. The bijection preserves two sets of parameters, degrees and generalized returns. As a corollary, we generalize Jonsson's formula for $k=2$ by counting the number of $2$-triangulations of the $n$-gon with a given degree at a fixed vertex.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 11:06:27 AM
Last modification on : Wednesday, August 21, 2019 - 10:22:02 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 10:11:23 AM


Publisher files allowed on an open archive




Carlos M. Nicolás. Another bijection between $2$-triangulations and pairs of non-crossing Dyck paths. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. pp.697-708, ⟨10.46298/dmtcs.2683⟩. ⟨hal-01185375⟩



Record views


Files downloads