Bijective proofs of the hook formula for rooted trees.

MaRDI QIDQ2846665zbMATH OpenFDO

Authors Beáta Bényi

Publication date 9 September 2013

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

hook length formularooted tree

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of representation theory (05E10)

Review text

The hook length formula for rooted trees has been received a lot of attention, for example see [\textit{G.-N. Han}, Electron. J. Comb. 15, No. 1, Research Paper R133, 41 p. (2008; Zbl 1165.05305)]. Based on the ideas of the paper [\textit{J. C. Novelli, I. Pak} and \textit{A. V. Stoyanovskii}, Discrete Math. Theor. Comput. Sci. 1, No. 1, 53--67 (1997; Zbl 0934.05125)], the author gave two bijective proofs of the hook length formula for rooted trees.

Recommendations

• On Han's hook length formulas for trees
• scientific article; zbMATH DE number 1375571
• Probabilistic proofs of hook length formulas involving trees
• A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof

Cited in

(8)

• A probabilistic method for the number of standard immaculate tableaux
• Hook inequalities
• Probabilistic proofs of hook length formulas involving trees
• Bijections on rooted trees with fixed size of maximal decreasing subtrees
• Effective Poset Inequalities
• On Han's hook length formulas for trees
• Hook length polynomials for plane forests of a certain type
• A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof

This page was built for publication: Bijective proofs of the hook formula for rooted trees.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846665)