Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted
type: Item
instance of: scholarly article
title: Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted
zbMATH Open document ID: 0822.05065
published in: The Electronic Journal of Combinatorics
publication date: 1995-08-08T00:00:00Z
full work available at URL: https://eudml.org/doc/118680
full work available at URL: R13
review text: Summary: 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 Stanley's \((P, \omega)\)-partition theorem with the involution principle of Garsia and Milne.
Mathematics Subject Classification ID: 05E10
zbMATH DE Number: 782526
zbMATH Keywords: hook formulas
zbMATH Keywords: standard Young tableaux
zbMATH Keywords: Hillman-Grassl algorithm
zbMATH Keywords: involution principle
author: C. Krattenthaler
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 782526