𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Alternating permutations and binary increasing trees

✍ Scribed by Robert Donaghey

Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
332 KB
Volume
18
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Permutation Trees and Variation Statisti
Permutation Trees and Variation Statistics
✍ GΓ‘bor Hetyei; Ethan Reiner πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 277 KB

In this paper we exploit binary tree representations of permutations to give a combinatorial proof of Purtill's result [8] that where A n is the set of AndrΓ© permutations, v cd (Οƒ ) is the cd-statistic of an AndrΓ© permutation and v ab (Οƒ ) is the ab-statistic of a permutation. Using Purtill's proof

On the distribution of binary search tre
On the distribution of binary search trees under the random permutation model
✍ James Allen Fill πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 865 KB

We study the distribution Q on the set B, of binary search trees over a linearly ordered set of n records under the standard random permutation model. This distribution also arises as the stationary distribution for the move-to-root (MTR) Markov chain taking values in B,, when successive requests ar

Representation of permutations, combinat
Representation of permutations, combinations and dihedral elements as trees
✍ B.J. Arnow πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 162 KB

Permutations and combinations of n objects as well as the elements of the dihedral group of order 2n (i.e. flips and rotation of an n-gun) are represented as nodes of trees. The algorithms for generating the nodes and traversing the trees are illustrated using flowcharts and specific walk-throughs f