New hook length formulas for binary trees
Combinatorics
2008-04-24 v1
Abstract
We find two new hook length formulas for binary trees. The particularity of our formulas is that the hook length appears as an exponent.
Cite
@article{arxiv.0804.3638,
title = {New hook length formulas for binary trees},
author = {Guo-Niu Han},
journal= {arXiv preprint arXiv:0804.3638},
year = {2008}
}
Comments
4 pages