scholarly journals A Refinement of Cayley's Formula for Trees

10.37236/1884 ◽  
2006 ◽  
Vol 11 (2) ◽  
Author(s):  
Ira M. Gessel ◽  
Seunghyun Seo

A proper vertex of a rooted tree with totally ordered vertices is a vertex that is the smallest of all its descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all expressed in terms of the polynomials $$P_n(a,b,c)= c\prod_{i=1}^{n-1}(ia+(n-i)b +c),$$ which reduce to $(n+1)^{n-1}$ for $a=b=c=1$. Our study of proper vertices was motivated by Postnikov's hook length formula $$(n+1)^{n-1}={n!\over 2^n}\sum _T \prod_{v}\left(1+{1\over h(v)}\right),$$ where the sum is over all unlabeled binary trees $T$ on $n$ vertices, the product is over all vertices $v$ of $T$, and $h(v)$ is the number of descendants of $v$ (including $v$). Our results give analogues of Postnikov's formula for other types of trees, and we also find an interpretation of the polynomials $P_n(a,b,c)$ in terms of parking functions.

2019 ◽  
Author(s):  
Tomás Martínez Coronado ◽  
Arnau Mir ◽  
Francesc Rossello ◽  
Lucía Rotger

Abstract Background: The Sackin index S of a rooted phylogenetic tree, defined as the sum of its leaves' depths, is one of the most popular balance indices in phylogenetics, and Sackin's 1972 paper is usually cited as the source for this index. However, what Sackin actually proposed in his paper as a measure of the imbalance of a rooted tree was not the sum of its leaves' depths, but their "variation". This proposal was later implemented as the variance of the leaves' depths by Kirkpatrick and Slatkin, where moreover they posed the problem of finding a closed formula for its expected value under the Yule model. Nowadays, Sackin's original proposal seems to have passed into oblivion in the phylogenetics literature, replaced by the index bearing his name, which, in fact, was introduced a decade later by Sokal.Results: In this paper we study the properties of the variance of the leaves' depths, V, as a balance index. Firstly, we prove that the rooted trees with n leaves and maximum V value are exactly the combs with n leaves. But although V achieves its minimum value on every space BT_n of bifurcating rooted phylogenetic trees with n< 184 leaves at the so-called "maximally balanced trees" with n leaves, this property fails for almost every n>= 184. We provide then an algorithm that finds in O(n) time the trees in BT_n with minimum V value. Secondly, we obtain closed formulas for the expected V value of a bifurcating rooted tree with any number n of leaves under the Yule and the uniform models and, as a by-product of the computations leading to these formulas, we also obtain closed formulas for the variance of the Sackin index and the total cophenetic indexof a bifurcating rooted tree, as well as of their covariance, under the uniform model, thus filling this gap in the literature.Conclusions: The phylogenetics crowd has been wise in preferring as a balance index the sum S(T) of the leaves’ depths of a phylogenetic tree T over their variance V (T), because the latter does not seem to capture correctly the notion of balance of large bifurcating rooted trees. But for bifurcating trees up to 183 leaves, V is a valid and useful balance index.


10.37236/1890 ◽  
2005 ◽  
Vol 11 (2) ◽  
Author(s):  
Seunghyun Seo

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled $k$-ary trees, rooted labeled trees, and labeled plane trees.


2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Samuele Giraudo

International audience We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar combinatorial objects: parking functions, packed words, planar rooted trees, generalized Dyck paths, Schröder trees, Motzkin paths, integer compositions, directed animals, etc. We also retrieve some known operads: the magmatic operad, the commutative associative operad, and the diassociative operad.


2017 ◽  
Vol 26 (02) ◽  
pp. 1740016 ◽  
Author(s):  
Zhiyun Cheng ◽  
Sujoy Mukherjee ◽  
Józef H. Przytycki ◽  
Xiao Wang ◽  
Seung Yeop Yang

We give necessary and sufficient conditions for a given polynomial to be a plucking polynomial of a rooted tree. We discuss the fact that different rooted trees can have the same polynomial.


1969 ◽  
Vol 10 (3-4) ◽  
pp. 278-282 ◽  
Author(s):  
John Riordan ◽  
N. J. A. Sloane

The height (as in [3] and [4]) of a point in a rooted tree is the length of the path (that is, the number of lines in the path) from it to the root; the total height of a rooted tree is the sum of the heights of its points. The latter arises naturally in studies of random neural networks made by one of us (N.J.A.S.), where the enumeration of greatest interest is that of trees with all points distinctly labeled.


COMBINATORICA ◽  
2010 ◽  
Vol 30 (2) ◽  
pp. 253-256 ◽  
Author(s):  
Guo-Niu Han
Keyword(s):  

1971 ◽  
Vol 3 (01) ◽  
pp. 44-77 ◽  
Author(s):  
E. F. Harding

The set of rooted trees, generated by random bifurcation at the terminal nodes, is considered with the aims of enumerating it and of determining its probability distribution. The account of enumeration collates much previous work and attempts a complete perspective of the problems and their solutions. Asymptotic and numerical results are given, and some unsolved problems are pointed out. The problem of ascertaining the probability distribution is solved by obtaining its governing recurrence equation, and numerical results are given. The difficult problem of determining the most probable tree-shape of given size is considered, and for labelled trees a conjecture at its solution is offered. For unlabelled shapes the problem remains open. These mathematical problems arise in attempting to reconstruct evolutionary trees by the statistical approach of Cavalli-Sforza and Edwards.


10.37236/1152 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Stephan G. Wagner

This note deals with a formula due to G. Labelle for the summed cycle indices of all rooted trees, which resembles the well-known formula for the cycle index of the symmetric group in some way. An elementary proof is provided as well as some immediate corollaries and applications, in particular a new application to the enumeration of $k$-decomposable trees. A tree is called $k$-decomposable in this context if it has a spanning forest whose components are all of size $k$.


2020 ◽  
Author(s):  
Tomás Martínez Coronado ◽  
Arnau Mir ◽  
Francesc Rossello ◽  
Lucía Rotger

Abstract Background. The Sackin index S of a rooted phylogenetic tree, defined as the sum of its leaves' depths, is one of the most popular balance indices in phylogenetics, and Sackin's 1972 paper is usually cited as the source for this index. However, what Sackin actually proposed in his paper as a measure of the imbalance of a rooted tree was not the sum of its leaves' depths, but their ``variation''. This proposal was later implemented as the variance of the leaves' depths by Kirkpatrick and Slatkin in 1993, where they also posed the problem of finding a closed formula for its expected value under the Yule model. Nowadays, Sackin's original proposal seems to have passed into oblivion in the phylogenetics literature, replaced by the index bearing his name, which, in fact, was introduced a decade later by Sokal. Results. In this paper we study the properties of the variance of the leaves' depths, V, as a balance index. Firstly, we prove that the rooted trees with $n$ leaves and maximum V value are exactly the combs with n leaves. But although V achieves its minimum value on every space of bifurcating rooted phylogenetic trees with at most 183 leaves at the so-called ``maximally balanced trees'' with n leaves, this property fails for almost every n larger than 184 We provide then an algorithm that finds the bifurcating rooted trees with n leaves and minimum V value in quasilinear time. Secondly, we obtain closed formulas for the expected V value of a bifurcating rooted tree with any number n of leaves under the Yule and the uniform models and, as a by-product of the computations leading to these formulas, we also obtain closed formulas for the variance under the uniform model of the Sackin index and the total cophenetic index of a bifurcating rooted tree, as well as of their covariance, thus filling this gap in the literature.


10.37236/1266 ◽  
1995 ◽  
Vol 3 (2) ◽  
Author(s):  
Ira M. Gessel

A descent of a rooted tree with totally ordered vertices is a vertex that is greater than at least one of its children. A leaf is a vertex with no children. We show that the number of forests of rooted trees on a given vertex set with $i+1$ leaves and $j$ descents is equal to the number with $j+1$ leaves and $i$ descents. We do this by finding a functional equation for the corresponding exponential generating function that shows that it is symmetric.


Sign in / Sign up

Export Citation Format

Share Document