A bijective proof of the hook-length formula

DOI10.1016/0196-6774(82)90029-3MaRDI QIDQ3964024zbMATH OpenOpenAlexWikidataFDO

Authors D. S. Franzblau, Doron Zeilberger

Publication date 1982

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(82)90029-3

zbMATH Keywords

Ferrers diagramstandard Young tableaux

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(13)

• Binomial determinants, paths, and hook length formulae
• Jack symmetric functions and some combinatorial properties of Young symmetrizers
• A combinatorial proof of the Giambelli identity for Schur functions
• Enumeration of lattice paths and generating functions for skew plane partitions
• Standard Young tableaux of height 4 and 5
• A probabilistic method for the number of standard immaculate tableaux
• A bijective proof of the hook-length formula for standard immaculate tableaux
• Quantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagrams
• The weighted hook length formula
• A bijective proof of the hook-length formula for skew shapes
• Lagrange's identity and the Hook formula
• On an identity of Glass and Ng concerning the hook length formula
• A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof

This page was built for publication: A bijective proof of the hook-length formula

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