Leaf-colored binary trees, with an induced integer "length," arise in biomathematics. We analyse such trees in terms of a natural bipartition of their edge set, and, extending a recent decomposition for binary trees, obtain enumerative formulae. 1993 Academic Press. Inc.
A binary tree decomposition space of permutation statistics
โ Scribed by Don Rawlings
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 578 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
AbsOIcL Wc consider the se; of n x n ma,'rtces X = (x~i) fog which ~i~iEi~.,xii ~ ill ~-;3;-n, ft~r all t,J c: {I, 2 ..... n~. with x/j ;) 0 foยข all J, IE~i, 2, .... q}. it is sl~,;)wn that such ma-~:rkยข~ may bt (Ik ~:ompoted as X --$+ N. whe~.e S is a &~bly stochastic matrix 'and N is now ne~ttive