Two kinds of hook length formulas for complete $m$-ary trees
Combinatorics
2008-05-12 v1
Abstract
In this paper, we define two kinds of hook length for internal vertices of complete -ary trees, and deduce their corresponding hook length formulas, which generalize the main results obtained by Du and Liu.
Cite
@article{arxiv.0805.1272,
title = {Two kinds of hook length formulas for complete $m$-ary trees},
author = {Yidong Sun and Huajun Zhang},
journal= {arXiv preprint arXiv:0805.1272},
year = {2008}
}
Comments
6 pages, 1 figure. To appear in Discrete Mathematics