This material has been published in
J. Combin. 2 (1995), #R13, 9 pp.
Bijective proofs of the hook formulas for the
number of standard Young tableaux, ordinary and shifted
Bijective proofs of the hook formulas for the number of ordinary
standard Young tableaux and for the number of shifted standard Young
tableaux are given. They are formulated in a uniform manner, and in
fact prove q-analogues of the ordinary and shifted hook formulas.
The proofs proceed by combining the ordinary, respectively shifted,
Hillman-Grassl algorithm and
with the involution principle of Garsia and
The following versions are available:
Back to Christian Krattenthaler's