HookExp

swMATH4284MaRDI QIDQ16465

No author found.

Described by source

• Discovering hook length formulas by an expansion technique

Related Items (15)

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 ⋮ On Han's hook length formulas for trees ⋮ Bilabelled increasing trees and hook-length formulae ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ Note on ``hook-length as a graph invariant of trees ⋮ Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees ⋮ 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 ⋮ Some Conjectures and Open Problems on Partition Hook Lengths ⋮ A note on some new hook-content identities ⋮ Combining hook length formulas and BG-ranks for partitions via the Littlewood decomposition ⋮ Hook length formulas for trees by Han's expansion

This page was built for software: HookExp