New hook length formulas for binary trees

2008/04/23 by Guo-Niu Han, Han, Guo-Niu · 1 citation
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.0804.3638

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

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.

Cited by

• Discovering hook length formulas by expansion technique

Related

• Yet another generalization of Postnikov's hook length formula for binary trees
• On the Hook Length Formula for Binary Trees
• A note on hook length formulas for trees
• Hook Length Formulas for Trees by Han's Expansion
• Generalizations of Han's Hook Length Identities