Two kinds of hook length formulas for complete $m$-ary trees

Simple item page
dc.creatorSun, Yidong
dc.creatorZhang, Huajun
dc.date2008-05-09
dc.date.accessioned2026-07-07T09:37:58Z
dc.date.available2026-07-07T09:37:58Z
dc.descriptionIn this paper, we define two kinds of hook length for internal vertices of complete $m$-ary trees, and deduce their corresponding hook length formulas, which generalize the main results obtained by Du and Liu.
dc.description6 pages, 1 figure. To appear in Discrete Mathematics
dc.identifierhttps://arxiv.org/abs/0805.1272
dc.identifierhttp://arxiv.org/abs/0805.1272
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160644
dc.subjectCombinatorics
dc.subject05A15;05A19
dc.titleTwo kinds of hook length formulas for complete $m$-ary trees
dc.typetext

Files

Collections

arXiv