An involution principle-free bijective proof of Stanley's hook-content formula

Discrete Mathematics and Theoretical Computer Science

Volumn 3, Issue 1, 1998, Pages 11-32

  Krattenthaler, Christian ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Hillman Grassl algorithm; Hook content formula; Involution principle; Jeu de taquin; Plane partitions; Tableaux

Indexed keywords

EID: 0346502400     PISSN: 13658050     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. G. E. Andrews, Plane partitions V: The t.s.s.c.p.p. conjecture, J. Combin. Theory Ser. A 66 (1994), 28-39.
2. A. M. Garsia and S. C. Milne, Method for constructing bijections for classical partition identities, Proc. Nat. Acad. Sci. U.S.A. 78 (1981), 2026-2028.
3. A. P. Hillman and R. M. Grassl, Reverse plane partitions and tableau hook numbers, J. Combin. Theory Ser. A 21 (1976), 216-221.
4. C. Krattenthaler, A determinant evaluation and some enumeration results for plane partitions, in: Number-Theoretic Analysis, E. Hlawka, R. F. Tichy (eds.), Lect. Notes in Math. 1452, Springer-Verlag, Berlin, New York, 1990, pp. 121-131.
5. C. Krattenthaler, Another involution principle-free bijective proof of Stanley's hook-content formula, preprint.
6. G. Kuperberg, Symmetries of plane partitions and the permanent- determinant method, J. Combin. Theory Ser. A 68 (1994), 115-151.
7. P. A. MacMahon, Combinatory Analysis, Cambridge University Press, 1916; reprinted by Chelsea, New York, 1960.
8. J. C. Novelli, I. M. Pak and A. V. Stoyanovsii, A direct bijective proof of the hook-length formula, Discrete Math. Theoret. Computer Science 1 (1997), 053-067.
9. I. M. Pak and A. V. Stoyanovskii, A bijective proof of the hook-length formula and its analogues, Funkt. Anal. Priloz. 26, no. 3 (1992), 80-82;
10. English translation in Funct. Anal. Appl. 26 (1992), 216-218.
11. J. B. Remmel and R. Whitney, A bijective proof of the hook formula for the number of column-strict tableaux with bounded entries, Europ. J. Combin. 4 (1983), 45-63.
12. B. E. Sagan, Enumeration of partitions with hooklengths, Europ. J. Combin. 3 (1982), 85-94.
13. B. E. Sagan, Shifted tableaux, Schur Q-functions, and a conjecture of R. Stanley, J. Combin. Theory Ser. A 45 (1987), 62-103.
14. B. E. Sagan, The symmetric group, Wadsworth & Brooks/Cole, Pacific Grove, California, 1987.
15. M.-P. Schützenberger, La correspondance de Robinson, in: Combinatoire et Représentation du Groupe Symétrique, Lecture Notes in Math., vol. 579, Springer-Verlag, Berlin-Heidelberg-New York, 1977, pp. 59-113.
16. R. P. Stanley, Theory and applications of plane partitions: Part 2, Stud. Appl. Math 50 (1971), 259-279.
17. R. P. Stanley, Symmetries of plane partitions, J. Combin. Theory A 43 (1986), 103-113; Erratum 44 (1987), 310.
18. D. Stanton and D. White, Constructive Combinatorics, Undergraduate Texts in Math., Springer-Verlag, New York, Berlin Heidelberg, Tokyo, 1986.
19. J. R. Stembridge, The enumeration of totally symmetric plane partitions, Adv. in Math. 111 (1995), 227-245.