{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:38:25Z","timestamp":1649187505592},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00493-010-2503-5","type":"journal-article","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T08:27:14Z","timestamp":1284625634000},"page":"253-256","source":"Crossref","is-referenced-by-count":2,"title":["New hook length formulas for binary trees"],"prefix":"10.1007","volume":"30","author":[{"given":"Guo-Niu","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,17]]},"reference":[{"key":"2503_CR1","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1016\/j.ejc.2007.11.025","volume":"29","author":"W. Y. C. Chen","year":"2008","unstructured":"W. Y. C. Chen and L. L. M. Yang: On Postnikov\u2019s hook length formula for binary trees, European J. Combin. 29 (2008), 1563\u20131565.","journal-title":"European J. Combin."},{"key":"2503_CR2","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1016\/j.ejc.2006.01.011","volume":"28","author":"R. R. X. Du","year":"2007","unstructured":"R. R. X. Du and F. Liu: (k,m)-Catalan numbers and hook length polynomials for plane trees, European J. Combin. 28 (2007), 1312\u20131321.","journal-title":"European J. Combin."},{"key":"2503_CR3","doi-asserted-by":"crossref","unstructured":"I. M. Gessel and S. Seo: A refinement of Cayley\u2019s formula for trees, Electron. J. Combin. 11(2) (2004\/06), Research Paper 27, 23 pp.","DOI":"10.37236\/1884"},{"key":"2503_CR4","unstructured":"G.-N. Han: Discovering hook lenght formulas by an expansion technique, Electron. J. Combin. 15(1) (2008), Research Paper 133, 41 pp."},{"key":"2503_CR5","volume-title":"The Art of Computer Programming, vol. 3","author":"D. E. Knuth","year":"1998","unstructured":"D. E. Knuth: The Art of Computer Programming, vol. 3, Sorting and Searching, 2nd ed., Addison Wesley, Longman, (1998).","edition":"2nd ed."},{"key":"2503_CR6","first-page":"21","volume":"49","author":"J. W. Moon","year":"2007","unstructured":"J. W. Moon and L. L. M. Yang: Postnikov identities and Seo\u2019s formulas, Bull. Inst. Combin. Appl. 49 (2007), 21\u201331.","journal-title":"Bull. Inst. Combin. Appl."},{"key":"2503_CR7","unstructured":"A. Postnikov: Permutohedra, associahedra, and beyond; arXiv:math.CO\/0507163, (2004)."},{"key":"2503_CR8","unstructured":"B. E. Sagan: Probabilistic proofs of hook length formulas involving trees, S\u00e9m. Lothar. Combin. 61A (2009), Article B61Ab, 10 pp."},{"key":"2503_CR9","doi-asserted-by":"crossref","unstructured":"S. Seo: A combinatorial proof of Postnikov\u2019s identity and a generalized enumeration of labeled trees, Electron. J. Combin. 11(2) (2004\/06), Note 3, 9 pp.","DOI":"10.37236\/1890"},{"key":"2503_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative Combinatorics, vol. 1","author":"R. P. Stanley","year":"1986","unstructured":"R. P. Stanley: Enumerative Combinatorics, vol. 1, Wadsworth & Brooks\/Cole, Monterey (1986)."},{"key":"2503_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative Combinatorics, vol. 2","author":"R. P. Stanley","year":"1999","unstructured":"R. P. Stanley: Enumerative Combinatorics, vol. 2, Cambridge University Press, Cambridge (1999)."},{"key":"2503_CR12","unstructured":"L. L. M. Yang: Generalizations of Han\u2019s hook length identities, arXiv:math.CO\/0805.0109, (2008)."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2503-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-010-2503-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2503-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T20:09:32Z","timestamp":1591906172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-010-2503-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["2503"],"URL":"https:\/\/doi.org\/10.1007\/s00493-010-2503-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}