A Refinement of Cayley's Formula for Trees

A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper 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(a+(n-1)b+c)(2a+(n-2)b+c)...((n-1)a+b+c) which reduce to (n+1)^{n-1} for a=b=c=1. Our study of proper vertices was motivated by A. Postnikov's hook length formula for binary trees (arXiv:math.CO/0507163), which was also proved by W. Y. C. Chen and L. L. M. Yang (arXiv:math.CO/0507163) and generalized by R. R. X. Du and F. Liu (arXiv:math.CO/0501147). Our approach gives a new proof of Du and Liu's results and gives new hook length formulas. We also find an interpretation of the polynomials P_n(a,b,c) in terms of parking functions: we count parking functions according to the number of cars that park in their preferred parking spaces.

[1]  Jiang Zeng.  A Ramanujan Sequence that Refines the Cayley Formula for Trees , 1999 .

[2]  Ömer Egecioglu,et al.  Bijections for Cayley trees, spanning trees, and their q-analogues , 1986, J. Comb. Theory, Ser. A.

[3]  Ira M. Gessel.  Counting forests by descents and leaves , 1996, Electron. J. Comb..

[4]  William Y.C. Chen,et al.  On the Hook Length Formula for Binary Trees , 2005 .

[5]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[6]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[7]  Gilbert Labelle,et al.  Combinatorial species and tree-like structures , 1997, Encyclopedia of mathematics and its applications.

[8]  Louis H. Kalikow.  Symmetries in trees and parking functions , 2002, Discret. Math..

[9]  Seunghyun Seo,et al.  A generalized enumeration of labeled trees and reverse Prüfer algorithm , 2007, J. Comb. Theory, Ser. A.

[10]  Catherine H. Yan,et al.  Generalized Parking Functions, Tree Inversions, and Multicolored Graphs , 2001, Adv. Appl. Math..

[11]  Seunghyun Seo.  A Combinatorial Proof of Postnikov's Identity and a Generalized Enumeration of Labeled Trees , 2005, Electron. J. Comb..

[12]  Fu Liu,et al.  (k, m)-Catalan numbers and hook length polynomials for plane trees , 2007, Eur. J. Comb..

[13]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[14]  William Y. C. Chen,et al.  Bijections behind the Ramanujan Polynomials , 2001, Adv. Appl. Math..

[15]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[16]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[17]  Peter W. Shor,et al.  A New Proof of Cayley's Formula for Counting Labeled Trees , 1995, J. Comb. Theory, Ser. A.

[18]  I. Goulden,et al.  Combinatorial Enumeration , 2004 .

[19]  D. White,et al.  Constructive combinatorics , 1986 .