Growing and Destroying Catalan-Stanley Trees
Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 1
Voir la notice de l'article provenant de la source Episciences
Stanley lists the class of Dyck paths where all returns to the axis are of odd length as one of the many objects enumerated by (shifted) Catalan numbers. By the standard bijection in this context, these special Dyck paths correspond to a class of rooted plane trees, so-called Catalan-Stanley trees. This paper investigates a deterministic growth procedure for these trees by which any Catalan-Stanley tree can be grown from the tree of size one after some number of rounds; a parameter that will be referred to as the age of the tree. Asymptotic analyses are carried out for the age of a random Catalan-Stanley tree of given size as well as for the "speed" of the growth process by comparing the size of a given tree to the size of its ancestors.
@article{DMTCS_2018_20_1_a7,
author = {Hackl, Benjamin and Prodinger, Helmut},
title = {Growing and {Destroying} {Catalan-Stanley} {Trees}},
journal = {Discrete mathematics & theoretical computer science},
publisher = {mathdoc},
volume = {20},
number = {1},
year = {2018},
doi = {10.23638/DMTCS-20-1-11},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-11/}
}
TY - JOUR AU - Hackl, Benjamin AU - Prodinger, Helmut TI - Growing and Destroying Catalan-Stanley Trees JO - Discrete mathematics & theoretical computer science PY - 2018 VL - 20 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-11/ DO - 10.23638/DMTCS-20-1-11 LA - en ID - DMTCS_2018_20_1_a7 ER -
%0 Journal Article %A Hackl, Benjamin %A Prodinger, Helmut %T Growing and Destroying Catalan-Stanley Trees %J Discrete mathematics & theoretical computer science %D 2018 %V 20 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-11/ %R 10.23638/DMTCS-20-1-11 %G en %F DMTCS_2018_20_1_a7
Hackl, Benjamin; Prodinger, Helmut. Growing and Destroying Catalan-Stanley Trees. Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 1. doi: 10.23638/DMTCS-20-1-11
Cité par Sources :