Yet another generalization of Postnikov's hook length formula for binary trees
Combinatorics
2008-04-29 v1
Abstract
We discover another one-parameter generalization of Postnikov's hook length formula for binary trees. The particularity of our formula is that the hook length appears as an exponent. As an application, we derive another simple hook length formula for binary trees when the underlying parameter takes the value 1/2.
Cite
@article{arxiv.0804.4268,
title = {Yet another generalization of Postnikov's hook length formula for binary trees},
author = {Guo-Niu Han},
journal= {arXiv preprint arXiv:0804.4268},
year = {2008}
}
Comments
4 pages