New hook length formulas for binary trees

DOI10.1007/S00493-010-2503-5MaRDI QIDQ5916092zbMATH OpenOpenAlexFDO

Authors Guo-Niu Han

Publication date 16 November 2012

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0804.3638, http://rd.springer.com/article/10.1007/s00493-010-2503-5

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05)

Abstract: We find two new hook length formulas for binary trees. The particularity of our formulas is that the hook length $h_v$ appears as an exponent.

Cites work

• \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
• A refinement of Cayley's formula for trees
• Discovering hook length formulas by an expansion technique
• Linear probing and graphs
• On Postnikov's hook length formula for binary trees
• Postnikov identities and Seo's formulas
• Probabilistic proofs of hook length formulas involving trees

Cited in

(5)

• A unifying approach for proving hook-length formulas for weighted tree families
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
• scientific article; zbMATH DE number 6806786 (Why is no real title available?)
• Periodic Pólya urns, the density method and asymptotics of Young tableaux
• On Postnikov's hook length formula for binary trees

This page was built for publication: New hook length formulas for binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5916092)