On Postnikov's hook length formula for binary trees

European Journal of Combinatorics

Volumn 29, Issue 7, 2008, Pages 1563-1565

  Chen, William Y C ^a   Yang, Laura L M ^a  

^a NANKAI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 45449117903     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.11.025     Document Type: Article

References (8)

1. Du R.R.X., and Liu F. (k, m)-Catalan numbers and hook length polynomials for plane trees. European J. Combin. 28 (2007) 1312-1321
2. Gessel I.M., and Seo S. A refinement of Cayley's formula for trees. Electron. J. Combin. 11 2 (2006) #R27
3. F. Hivert, J.-C. Novelli, J.-Y. Thibon, Trees, functional equations, and combinatorial Hopf algebras, European J. Combin. (in press)
4. F. Liu, Hook length polynomials for plane forests of a certain type. arXiv:math.CO/0511055
5. Moon J.W. Counting Labelled Trees. Canadian Mathematical Monographs (1970)
6. A. Postnikov, Permutohedra, associahedra, and beyond, in: Conference in Honor of Richard Stanley's Sixtieth Birthday, June 26, 2004, MIT. arXiv:math.Co/0507163
7. Seo S. A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees. Electron. J. Combin. 11 2 (2005) #N3
8. Stanley R.P. Enumerative Combinatorics vol. 2 (1999), Cambridge University Press, Cambridge, UK