Discovering hook length formulas by an expansion technique

zbMath1165.05305arXiv0805.2464MaRDI QIDQ1010868

Guo-Niu Han

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.2464

zbMATH Keywords

partitionsplane treeshook length expansionhook length formulasMaple package HookExp

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) (q)-calculus and related topics (05A30)

Related Items

A unifying approach for proving hook-length formulas for weighted tree families ⋮ Towards Heim and Neuhauser's unimodality conjecture on the Nekrasov-Okounkov polynomials ⋮ Hook lengths and shifted parts of partitions ⋮ Bilabelled increasing trees and hook-length formulae ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications ⋮ The weighted hook length formula ⋮ Colored partitions and the hooklength formula: partition statistic identities ⋮ A note on some new hook-content identities ⋮ New hook length formulas for binary trees ⋮ New hook length formulas for binary trees ⋮ Combining hook length formulas and BG-ranks for partitions via the Littlewood decomposition ⋮ HookExp

Uses Software

• Maple