Abstract: Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han's formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang's extension. We give combinatorial proofs of Yang's formula for k-ary trees and the other formula of Han for binary trees. Our bijections are based on the structure of k-ary trees with staircase labelings.
Recommendations
Cited in
(13)- Explicit formulas for a sequence of binary tree polynomials
- scientific article; zbMATH DE number 6806786 (Why is no real title available?)
- \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
- A unifying approach for proving hook-length formulas for weighted tree families
- Probabilistic proofs of hook length formulas involving trees
- A refinement of the formula for \(k\)-ary trees and the Gould-Vandermonde's convolution
- Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
- Bijective proofs of the hook formula for rooted trees.
- A multivariate hook formula for labelled trees
- Bilabelled increasing trees and hook-length formulae
- On Postnikov's hook length formula for binary trees
- Hook length formulas for trees by Han's expansion
- Two kinds of hook length formulas for complete \(m\)-ary trees
This page was built for publication: On Han's hook length formulas for trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640404)
