On Postnikov's hook length formula for binary trees
From MaRDI portal
Publication:942125
DOI10.1016/j.ejc.2007.11.025zbMath1152.05303arXivmath/0504260OpenAlexW2167192293MaRDI QIDQ942125
Laura L. M. Yang, William Y. C. Chen
Publication date: 4 September 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0504260
Related Items
An insertion algorithm and leaders of rooted trees ⋮ Bilabelled increasing trees and hook-length formulae ⋮ Hook length polynomials for plane forests of a certain type ⋮ Trees, functional equations, and combinatorial Hopf algebras ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- The algebra of binary search trees
- Hook length polynomials for plane forests of a certain type
- A refinement of Cayley's formula for trees
- \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees