Hook length polynomials for plane forests of a certain type

Simple item page
dc.creatorLiu, Fu
dc.date2005-11-02
dc.date.accessioned2026-07-07T06:50:41Z
dc.date.available2026-07-07T06:50:41Z
dc.descriptionThe 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.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/math/0511055
dc.identifierhttp://arxiv.org/abs/math/0511055
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104741
dc.subjectCombinatorics
dc.subject05A15, 05A19
dc.titleHook length polynomials for plane forests of a certain type
dc.typetext

Files

Collections

arXiv