论文信息 - Generalizations of Han's Hook Length Identities - 字舞流文

Generalizations of Han's Hook Length Identities

Han recently discovered new hook length identities for binary trees. In this paper, we extend Han's identities to binomial families of trees. Moreover, we present a bijective proof of one of the identities for the family of ordered trees.

Laura L.M. Yang | L. Yang

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

[2] Guo-Niu Han,et al. New hook length formulas for binary trees , 2008, Comb..

[3] Ira M. Gessel,et al. A Refinement of Cayley's Formula for Trees , 2006, Electron. J. Comb..

[4] J. Moon. Postnikov Identities and Seo ’ s Formulas , 2006 .

[5] S. G. Mohanty,et al. Lattice Path Counting and Applications. , 1980 .

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

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

[8] William Y. C. Chen,et al. On Postnikov's hook length formula for binary trees , 2008, Eur. J. Comb..

[9] Guo-Niu Han,et al. Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees , 2008, SIAM J. Discret. Math..