Discovering hook length formulas by an expansion technique

MaRDI QIDQ1010868zbMATH OpenFDO

Authors 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, https://eudml.org/doc/130272, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r133.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

hook length expansionhook length formulasMaple package HookExppartitionsplane trees

Mathematics Subject Classification ID

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

Abstract: We introduce the hook length expansion technique and explain how to discover old and new hook length formulas for partitions and plane trees. The new hook length formulas for trees obtained by our method can be proved rather easily, whereas those for partitions are much more difficult and some of them still remain open conjectures. We also develop a Maple package HookExp for computing the hook length expansion. The paper can be seen as a collection of hook length formulas for partitons and plane trees. All examples are illustrated by HookExp and, for many easy cases, expained by well-known combinatorial arguments.

Review text

Summary: We introduce a hook length expansion technique and explain how to discover old and new hook length formulas for partitions and plane trees. The new hook length formulas for trees obtained by our method can be proved rather easily, whereas those for partitions are much more difficult and some of them still remain open conjectures. We also develop a Maple package HookExp for computing the hook length expansion. The paper can be seen as a collection of hook length formulas for partitons and plane trees. All examples are illustrated by HookExp and, for many easy cases, explained by well-known combinatorial arguments.

Recommendations

• Hook length formulas for trees by Han's expansion
• A unifying approach for proving hook-length formulas for weighted tree families
• Hook length polynomials for plane forests of a certain type
• Probabilistic proofs of hook length formulas involving trees
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees

Cited in

(17)

• HookExp
• A note on some new hook-content identities
• A unifying approach for proving hook-length formulas for weighted tree families
• Towards Heim and Neuhauser's unimodality conjecture on the Nekrasov-Okounkov polynomials
• Combining hook length formulas and BG-ranks for partitions via the Littlewood decomposition
• Combinatorial families of multilabelled increasing trees and hook-length formulas
• Colored partitions and the hooklength formula: partition statistic identities
• The weighted hook length formula
• New hook length formulas for binary trees
• New hook length formulas for binary trees
• Hook lengths and shifted parts of partitions
• Bilabelled increasing trees and hook-length formulae
• Some equidistributed statistics and applications to hook length formulas
• Macdonald identities, Weyl-Kac denominator formulas and affine Grassmannian elements
• Enumerative combinatorics. Abstracts from the workshop held January 11--16, 2026
• Some combinatorial interpretations of the Macdonald identities for affine root systems and Nekrasov-Okounkov type formulas
• The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Discovering hook length formulas by an expansion technique

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