Name
Abstract | ||
|---|---|---|
The hook-length formula is a well known result expressing the number of standard tableaux of shape lambda in terms of lengths of the hooks in the diagram of lambda. Many proofs of this fact have been given, of varying complexity. We present here an elementary new proof which uses nothing more than the fundamental theorem of algebra. This proof was suggested by a q, t-analog of the hook formula given by Garsia and Tesler, and is roughly based on the inductive approach of Greene, Nijenhuis and Wilf. We also prove the hook formula in the case of shifted Young tableaux using the sample technique. |
Year | Venue | Keywords |
|---|---|---|
2008 | ELECTRONIC JOURNAL OF COMBINATORICS | young tableaux |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Nothing,Fundamental theorem of algebra,Elementary proof,Diagram,Hook length formula,Mathematical proof,Young tableau,Hook,Mathematics | Journal | 15.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 7 |
PageRank | References | Authors |
0.67 | 2 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jason Bandlow | 1 | 25 | 4.10 |