A bijective proof of the hook-length formula

DOI10.1016/0196-6774(82)90029-3zbMath0498.68042OpenAlexW1965521120WikidataQ114214906 ScholiaQ114214906MaRDI QIDQ3964024

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

standard Young tableauxFerrers diagram

Mathematics Subject Classification ID

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

Related Items (14)

A probabilistic method for the number of standard immaculate tableaux ⋮ 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 ⋮ Quantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagrams ⋮ Lagrange's identity and the Hook formula ⋮ The weighted hook length formula ⋮ On an identity of Glass and Ng concerning the hook length formula ⋮ A bijective proof of the hook-length formula for skew shapes ⋮ A bijective proof of the hook-length formula for standard immaculate tableaux ⋮ A bijective proof of the hook-length formula for skew shapes ⋮ A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof ⋮ Binomial determinants, paths, and hook length formulae

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