Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted (Q1894658): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 05:07, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted |
scientific article |
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