Bilabelled increasing trees and hook-length formulae
From MaRDI portal
(Redirected from Publication:658008)
Recommendations
Cites work
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
- A refinement of Cayley's formula for trees
- A unifying approach for proving hook-length formulas for weighted tree families
- Analytic combinatorics
- Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
- Discovering hook length formulas by an expansion technique
- Hook length formulas for trees by Han's expansion
- On Postnikov's hook length formula for binary trees
- Permutohedra, Associahedra, and Beyond
- Probabilistic proofs of hook length formulas involving trees
- The doubloon polynomial triangle
Cited in
(13)- A new bijection on rooted forests
- A unifying approach for proving hook-length formulas for weighted tree families
- On bucket increasing trees, clustered increasing trees and increasing diamonds
- Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
- q-hook length formulas for signed labeled forests
- Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
- Weakly increasing trees on a multiset
- Tree hook length formulae, Feynman rules and B-series
- An edge-weighted hook formula for labelled trees
- A multivariate hook formula for labelled trees
- Combinatorial families of multilabelled increasing trees and hook-length formulas
- On Postnikov's hook length formula for binary trees
- An insertion algorithm and leaders of rooted trees
This page was built for publication: Bilabelled increasing trees and hook-length formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658008)
