A short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof
暂无分享，去创建一个
Abstract The celebrated Frame-Robinson-Thrall (Canad. J. Math. 6 (1954) 316–324) hook-lengths formula, counting the Young tableaux of a specified shape, is given a short bijective proof. This proof was obtained by translating the elegant Greene-Nijenhuis-Wilf proof (Adv. in Math. 31 (1979) 104–109) into bijective language.
[1] H. Wilf,et al. A probabilistic proof of a formula for the number of Young tableaux of a given shape , 1979 .
[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[3] A.M Garsia,et al. A Rogers-Ramanujan Bijection , 1981, J. Comb. Theory, Ser. A.
[4] J. S. Frame,et al. The Hook Graphs of the Symmetric Group , 1954, Canadian Journal of Mathematics.
[5] Jeffrey B. Remmel,et al. Bijective Proofs of Some Classical Partition Identities , 1982, J. Comb. Theory A.