Hook length polynomials for plane forests of a certain type
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0511055,
title = {Hook length polynomials for plane forests of a certain type},
author = {Fu Liu},
journal= {arXiv preprint arXiv:math/0511055},
year = {2007}
}
备注
7 pages