Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
From MaRDI portal
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 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.
Recommendations
- On Postnikov's hook length formula for binary trees
- New hook length formulas for binary trees
- New hook length formulas for binary trees
- Two kinds of hook length formulas for complete \(m\)-ary trees
- Bilabelled increasing trees and hook-length formulae
- On Han's hook length formulas for trees
- Probabilistic proofs of hook length formulas involving trees
- A unifying approach for proving hook-length formulas for weighted tree families
- Hook length formulas for trees by Han's expansion
- Note on ``hook-length as a graph invariant of trees
Cited in
(8)- Discovering hook length formulas by an expansion technique
- Hook length formulas for trees by Han's expansion
- A unifying approach for proving hook-length formulas for weighted tree families
- Postnikov identities and Seo's formulas
- Note on ``hook-length as a graph invariant of trees
- Hook length polynomials for plane forests of a certain type
- An insertion algorithm and leaders of rooted trees
- On Postnikov's hook length formula for binary trees
This page was built for publication: Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563932)
