REFERENCES
- J. S. Frame, G. de B. Robinson, and R. M. Thrall, The hook graphs of the symmetric group, Canad. J. Math. 6 (1954) 316–324.
- C. Greene, A. Nijenhuis, and H. S. Wilf, A probabilistic proof of a formula for the number of Young tableaux of a given shape, Adv. in Math. 31 (1979) 104–109.
- A. P. Hillman and R. M. Grassl, Reverse plane partitions and tableau hook numbers, J. Comb. Theory (A) 21 (1976) 216–221.
- D. E. Knuth, The Art of Computer Programming, vol. 3, 2nd ed., Addison-Wesley, Reading, MA, 1998.
- C. Krattenthaler, Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted, Electron. J. Combin. 2 (1995), research paper 13.
- I. G. MacDonald, Symmetric Functions and Hall Polynomials, 2nd ed., Clarendon Press, Oxford, 1995.
- I. Pak, Hook length formula and geometric combinatorics, Sém. Lothar. Combin. 46 (2001), article B46f (electronic).
- A. Regev, Generalized hook and content numbers identities, European J. Combin. 21 (2000) 949–957.
- B. E. Sagan, The Symmetric group. Representations, Combinatorial Algorithms, and Symmetric Functions, 2nd ed., Springer-Verlag, New York, 2001.
- R. P. Stanley, Enumerative combinatorics, vol. 2, Cambridge University Press, Cambridge, 1999.
- A. M. Vershik, Hook formula and related identities, J. Soviet Math. 59 (1992) 1029–1040.