Yet another generalization of Postnikov's hook length formula for binary trees

2008/04/27 by Guo-Niu Han, Han, Guo-Niu · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #Advanced Topics in Algebra #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications

paper · doi:10.48550/arxiv.0804.4268

openalex publication_date 2008/04/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We discover another one-parameter generalization of Postnikov's hook length formula for binary trees. The particularity of our formula is that the hook length h_v appears as an exponent. As an application, we derive another simple hook length formula for binary trees when the underlying parameter takes the value 1/2.

Cited by

• Discovering hook length formulas by expansion technique

Related

• On the Hook Length Formula for Binary Trees
• New hook length formulas for binary trees
• Hook Length Formulas for Trees by Han's Expansion
• A note on hook length formulas for trees
• Discovering hook length formulas by expansion technique