(k, m)-Catalan numbers and hook length polynomials for plane trees

European Journal of Combinatorics

Volumn 28, Issue 4, 2007, Pages 1312-1321

  Du, Rosena R X ^a,b   Liu, Fu ^c  

^a EAST CHINA NORMAL UNIVERSITY   (China)

^b NANKAI UNIVERSITY   (China)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (8)

1. Chen W.Y.C. A general bijective algorithm for increasing trees. Systems Sci. Math. Sci. 12 3 (1999) 193-203
2. W.Y.C. Chen, L.L.M. Yang, On the hook length formula for binary trees (preprint)
3. Goulden I.P., and Jackson D.M. Combinatorial Enumeration (1983), John Wiley, New York
4. Klarner D.A. Correspondences between plane trees and binary sequences. J. Combin. Theory, Ser. A. 9 (1970) 401-411
5. A. Postnikov, Permutohedra, associahedra, and beyond, in: Stanley Conference, June 26, 2004, MIT. Slides available at: http://www-math.mit.edu/~apost/talks/perm-slides.pdf
6. S. Seo, A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees, Electron. J. Combin. 11 (2) N3
7. Stanley R.P. Ordered structures and partitions. Mem. Amer. Math. Soc. 119 (1972)
8. Stanley R.P. Enumerative Combinatorics vol. 2 (1999), Cambridge University Press, Cambridge, UK