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

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.

[1]  Christian Krattenthaler.  Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes , 2006, Adv. Appl. Math..

[2]  B. Lindström.  On the Vector Representations of Induced Matroids , 1973 .

[3]  Vasilis Capoyleas,et al.  A turán-type theorem on chords of a convex polygon , 1992, J. Comb. Theory, Ser. B.

[4]  I. Gessel,et al.  Binomial Determinants, Paths, and Hook Length Formulae , 1985 .

[5]  Jakob Jonsson,et al.  Generalized triangulations and diagonal-free subsets of stack polyominoes , 2005, J. Comb. Theory, Ser. A.

[6]  Tomoki Nakamigawa,et al.  A generalization of diagonal flips in a convex polygon , 2000, Theor. Comput. Sci..

[7]  Martin Rubey.  Increasing and decreasing sequences in fillings of moon polyominoes , 2011, Adv. Appl. Math..

[8]  Sergi Elizalde.  A bijection between 2-triangulations and pairs of non-crossing Dyck paths , 2007, J. Comb. Theory, Ser. A.

[9]  Vincent Pilaud,et al.  Multitriangulations as Complexes of Star Polygons , 2007, Discret. Comput. Geom..

[10]  D. Knuth,et al.  Generating all trees : history of combinatorial generation , 2006 .

[11]  Christian Krattenthaler.  Watermelon configurations with wall interaction: exact and asymptotic results , 2005 .

[12]  C. L. Mallows,et al.  Some Aspects of the Random Sequence , 1965 .

[13]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[14]  J. W. Essam,et al.  Scaling Analysis for the Adsorption Transition in a Watermelon Network of n Directed Non-Intersecting Walks , 2001 .

[15]  L. W. Shapiro,et al.  A Catalan triangle , 1976, Discret. Math..

[16]  Jacobus H. Koolen,et al.  On Line Arrangements in the Hyperbolic Plane , 2002, Eur. J. Comb..

[17]  J. W. Essam,et al.  Return polynomials for non-intersecting paths above a surface on the directed square lattice , 2001 .

[18]  Emeric Deutsch,et al.  An involution on Dyck paths and its consequences , 1999, Discret. Math..