Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted (Q1894658)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 782526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted |
scientific article; zbMATH DE number 782526 |
Statements
Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted (English)
0 references
8 August 1995
0 references
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.
0 references
hook formulas
0 references
standard Young tableaux
0 references
Hillman-Grassl algorithm
0 references
involution principle
0 references
0.8714058995246887
0 references
0.8650037050247192
0 references
0.8642134666442871
0 references
0.8378186225891113
0 references
