Descendants in heap ordered trees or a triumph of computer algebra (Q1379174)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1120243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descendants in heap ordered trees or a triumph of computer algebra |
scientific article; zbMATH DE number 1120243 |
Statements
Descendants in heap ordered trees or a triumph of computer algebra (English)
0 references
22 February 1998
0 references
Summary: 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\geq j\). Precise expressions are derived for the probability distribution and all (factorial) moments.
0 references
heap ordered tree
0 references
planted plane tree
0 references
number of descendants
0 references
0.865024983882904
0 references
0.8358168601989746
0 references
0.799019992351532
0 references
0.7946392297744751
0 references
