Geodesic
Descendants in heap ordered trees or a triumph of computer algebra
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A heap ordered tree with $n$ nodes ("size $n$") is a planted plane tree together with a bijection from the nodes to the set $\{1,\dots,n\}$ which is monotonically increasing when going from the root to the leaves. We consider the number of descendants of the node $j$ in a (random) heap ordered tree of size $n\ge j$. Precise expressions are derived for the probability distribution and all (factorial) moments.
DOI : 10.37236/1253
Classification : 05A15, 05C05
Mots-clés : heap ordered tree, planted plane tree, number of descendants 
@article{10_37236_1253,
     author = {Helmut Prodinger},
     title = {Descendants in heap ordered trees or a triumph of computer algebra},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {1},
     doi = {10.37236/1253},
     zbl = {0885.05004},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1253/}
}
TY  - JOUR
AU  - Helmut Prodinger
TI  - Descendants in heap ordered trees or a triumph of computer algebra
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1253/
DO  - 10.37236/1253
ID  - 10_37236_1253
ER  - 
%0 Journal Article
%A Helmut Prodinger
%T Descendants in heap ordered trees or a triumph of computer algebra
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1253/
%R 10.37236/1253
%F 10_37236_1253
Helmut Prodinger. Descendants in heap ordered trees or a triumph of computer algebra. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1253

Cité par Sources :