On binary trees and Dyck paths
Panayotopoulos, A. ; Sapounakis, A.
Mathématiques et Sciences humaines, Tome 132 (1995), p. 39-51 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)

Sur les arbres binaires et les chemins de Dyck. Une bijection entre les arbres binaires à n sommets et les chemins de Dyck de longeur 2n est obtenue. Deux constructions permettent de passer d'un chemin de Dyck à un arbre binaire et d' un arbre binaire à un chemin de Dyck.

A bijection between the set of binary trees with n vertices and the set of Dyck paths of length 2n is obtained. Two constructions are given which enable to pass from a Dyck path to a binary tree and from a binary tree to a Dyck path.

Publié le : 1995-01-01
@article{MSH_1995__131__39_0,
     author = {Panayotopoulos, A. and Sapounakis, A.},
     title = {On binary trees and Dyck paths},
     journal = {Math\'ematiques et Sciences humaines},
     volume = {132},
     year = {1995},
     pages = {39-51},
     mrnumber = {1373114},
     zbl = {0848.05006},
     language = {en},
     url = {http://dml.mathdoc.fr/item/MSH_1995__131__39_0}
}

Panayotopoulos, A.; Sapounakis, A. On binary trees and Dyck paths. Mathématiques et Sciences humaines, Tome 132 (1995) pp. 39-51. http://gdmltest.u-ga.fr/item/MSH_1995__131__39_0/

[1] Hilton, P., Pedersen, J., "Catalan numbers, their generalization and their uses", The Mathematical Intelligencer, 2 (1991), 64-75. | MR 1098222 | Zbl 0767.05010

[2] Lalanne, J.C., "q-Bessel, arbres, et chemins valués ", J. Combin. Theory, Ser. A 60 (1992), 225-245. | MR 1168155 | Zbl 0754.05033

[3] Panayotopoulos, A., Sapounakis, A., "On binary trees and permutations", Math. Inf. Sci. hum., 117 (1992), 61-70. | Numdam | MR 1164609 | Zbl 0846.05021

[4] Rosenstiehl, P., "Scaffold permutations", Discrete Math., 75 (1989), 335-342. | MR 1001406 | Zbl 0668.05001