Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted

zbMath0822.05065MaRDI QIDQ1894658

Christian Krattenthaler

Publication date: 8 August 1995

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/118680

zbMATH Keywords

standard Young tableauxhook formulasHillman-Grassl algorithminvolution principle

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Related Items (11)

Corners of self-conjugate \((s,s + 1)\)-cores and \(( \overline{s}, \overline{s + 1})\)-cores ⋮ Hook formulas for skew shapes. I: \(q\)-analogues and bijections ⋮ On the relationship between pipe dreams and permutation words ⋮ Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications ⋮ Hook, line and sinker: a bijective proof of the skew shifted hook-length formula ⋮ Polynomiality of certain average weights for oscillating tableaux ⋮ 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 ⋮ An affine generalization of evacuation ⋮ An affine generalization of evacuation

This page was built for publication: Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted