Hook Length Polynomials for Plane Forests of a Certain Type
- Author(s): Liu, Fu
- et al.
Published Web Locationhttps://doi.org/10.1007/s00026-009-0028-7
The original motivation for the study of 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 that it can be factored into a product of linear forms. Some other enumerative results on forests are also given.
Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.