Hook length polynomials for plane forests of a certain type
From MaRDI portal
Publication:659804
DOI10.1007/S00026-009-0028-7zbMATH Open1229.05024arXivmath/0511055OpenAlexW2073114152MaRDI QIDQ659804FDOQ659804
Authors: Fu Liu
Publication date: 24 January 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
Abstract: The original motivation for study for hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux. In this paper, we define the hook length polynomial for plane forests of a given degree sequence type and show it can be factored into a product of linear forms. Some other enumerative results on forests are also given.
Full work available at URL: https://arxiv.org/abs/math/0511055
Recommendations
- \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
- Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
- Bijective proofs of the hook formula for rooted trees.
- Probabilistic proofs of hook length formulas involving trees
- Hook length formulas for trees by Han's expansion
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)
Cites Work
- Title not available (Why is that?)
- Permutohedra, Associahedra, and Beyond
- A refinement of Cayley's formula for trees
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
- A general bijective algorithm for trees.
- \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
- Title not available (Why is that?)
- On Postnikov's hook length formula for binary trees
- Title not available (Why is that?)
Cited In (8)
- Explicit formulas for a sequence of binary tree polynomials
- Hook-lengths and pairs of compositions
- \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
- \(q\)-hook length formulas for signed labeled forests
- Discovering hook length formulas by an expansion technique
- On Postnikov's hook length formula for binary trees
- An insertion algorithm and leaders of rooted trees
- A multivariate ``inv hook formula for forests
This page was built for publication: Hook length polynomials for plane forests of a certain type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659804)