A Probabilistic Proof of a Formula for the Number of Young Tableaux of a Given Shape
نویسندگان
چکیده
This paper contains a short proof of a formula by Frame, Robinson, and Thrall [I] h h w ic counts the number of Young tableaux of a given shape. Let X = {X, >, X, > ..’ 2 X,} be a partition of R. The Ferrers diagram of h is an array of cells doubly indexed by pairs (i, j) with 1 < i < m, 1 i and b = j. Define the hook length hij to be the number of cells in Hi, .
منابع مشابه
On Selecting a Random Shifted Young Tableau
The study of standard and generalized Young tableaux has led to interesting results in quite a number of areas of mathematics. These arrays are of importance in the representation theory of the symmetric and general linear groups [12], in invariant theory [7], and in connection with various combinatorial problems [ 11. In addition, many algorithms have been developed that manipulate the tableau...
متن کاملBijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted
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, ω)-partition theor...
متن کاملA bijective proof of the hook-length formula for skew shapes
A well-known theorem of Frame, Robinson, and, Thrall states that if h is a partition of n, then the number of Standard Young Tableaux of shape h is n! divided by the product of the hook-lengths. We give a new combinatorial proof of this formula by exhibiting a bijection between the set of unsorted Young Tableaux of shape A, and the set of pairs (T, S), where T is a Standard Young Tableau of sha...
متن کاملAn Elementary Proof of the Hook Formula
The hook-length formula is a well known result expressing the number of standard tableaux of shape λ in terms of the lengths of the hooks in the diagram of λ. 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 ...
متن کاملAnother Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula
Another bijective proof of Stanley’s hook-content formula for the generating function for semistandard tableaux of a given shape is given that does not involve the involution principle of Garsia and Milne. It is the result of a merge of the modified jeu de taquin idea from the author’s previous bijective proof (“An involution principle-free bijective proof of Stanley’s hook-content formula”, Di...
متن کامل