The Robinson-Schensted and Schützenberger algorithms, an elementary approach

Electronic Journal of Combinatorics

Volumn 3, Issue 2 R, 1996, Pages 1-32

  Van Leeuwen, Marc A A ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3242715999     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: None     Document Type: Article

References (62)

1. [BaVog] D. Barbasch and D. Vogan, "Primitive ideals and orbital integrals in complex classical groups", Mathematische Annalen 259, (1982), 153-199.
2. [BeSt] G. Benkart and J. Stroomer, "Tableau and insertion schemes for spinor representations of the orthogonal Lie algebra so(2r + 1, C)", J. Combin. Theory, Ser. A 57, (1991), 211-237.
3. [BeSoSt] G. Benkart, F. Sottile, J. Stroomer, Tableau switching: algorithms and applications, Preprint, submitted to J. Combin. Theory, Ser. A, (1993).
4. [Bere] A. Berele, "A Schensted-type correspondence for the symplectic group", J. Combin. Theory, Ser. A 43, (1986), 320-328.
5. [Fom1] S. V. Fomin, "Finite partially ordered sets and Young tableaux", Soviet Math. Dokl. 19, (1978), 1510-1514.
6. [Fom2] S. V. Fomin, "Generalised Robinson-Schensted-Knuth correspondence", Journal of Soviet Mathematics 41, (1988), 979-991. (Translation from (Russian characters) 155 (1986) 156-175; authorised translation available from the author).
7. [Fom3] S. Fomin, Dual graphs and Schensted correspondences, Proceedings of the 4th International conference on Formal power series and Algebraic combinatorics, Montreal, (1992).
8. [Fom4] S. Fomin, Schur operators and Knuth correspondences, Institut Mittag-Leffler report No. 17, (1991/92).
9. [Fom5] S. Fomin, "Duality of graded graphs", J. Algebr. Combinatorics 3, (1994), 357-404.
10. [Fom6] S. Fomin, "Schensted algorithms for dual graded graphs", J. Algebr. Combinatorics 4, (1995), 5-45.
11. [FoGr] S. Fomin and C. Greene, "A Littlewood-Richardson Miscellany", Europ. J. Combinatorics 14, (1993), 191-212.
12. [FomSt] S. Fomin and D. Stanton, Rim hook lattices, Institut Mittag-Leffler report No. 23, (1991/92).
13. [FrSch] F. G. Frobenius and I. Schur, "Über die reellen Darstellungen der endlichen Gruppen", Sitzungsberichte der Preussische Akademie, (1906), 186-208. Also in F. G. Frobenius: Gesammelte Abhandlungen (J.-P. Serre ed.), Springer Verlag (1968) 355-377.
14. [FrSch] F. G. Frobenius and I. Schur, "Über die reellen Darstellungen der endlichen Gruppen", Sitzungsberichte der Preussische Akademie, (1906), 186-208. Also in F. G. Frobenius: Gesammelte Abhandlungen (J.-P. Serre ed.), Springer Verlag (1968) 355-377.
15. [Garf] D. Garfinkle, "On the classification of primitive ideals for complex classical Lie Algebra's, I", Compositio Mathematica 75, (1990), 135-169.
16. [Gre1] C. Greene, "An extension of Schensted's Theorem", Advances in Mathematics 14, (1974), 254-265.
17. [Gre2] C. Greene, "Some partitions associated with a partially ordered set", J. Combin. Theory, Ser. A 20, (1976), 69-79.
18. [Haim1] M. D. Haiman, "On mixed insertion, symmetry, and shifted Young tableaux", J. Combin. Theory, Ser. A 50, (1989), 196-225.
19. [Haim2] M. D. Haiman, "Dual equivalence with applications, including a conjecture of Proctor", Discrete Mathematics 99, (1992), 79-113.
20. [Hes] W. H. Hesselink, "A classification of the nilpotent triangular matrices", Compositio Mathematica 55, (1985), 89-133.
21. [JaKer] G. James and A. Kerber, The representation theory of the symmetric group, Encyclopedia of mathematics and its applications (G.-C. Rota, ed.) Vol. 16, Addison-Wesley, Reading MA, 1981.
22. [Jos] A. Joseph, "Sur la classification des idéaux primitifs dans l'algèbre enveloppante d'une algèbre de Lie reductive", Comptes rendus de l'Acad. Sciences, serie A 284 #8, (1977), 425-427.
23. [KaLu] D. Kazhdan and G. Lusztig, "Representations of Coxeter groups and Hecke algebras", Inventiones Math. 53, (1979), 165-184.
24. [Kn1] D. E. Knuth, "Permutations, matrices and generalized Young tableaux", Pacific Journal of Math. 34, (1970), 709-727.
25. [Kn2] D. E. Knuth, The art of Computer programming, Vol. III Sorting and Searching, pp. 48-72, Addison-Wesley, 1975.
26. [LaSch] A. Lascoux and M. P. Schützenberger, "Le monoïde plaxique", Quad. Ricerca Scientifica C.N.R. 109, (1981), 129-156.
27. [vLee1] M. A. A. van Leeuwen, A Robinson-Schensted algorithm in the geometry of flags for Classical Groups, Thesis (Rijksuniversiteit Utrecht, the Netherlands), (1989).
28. [vLee2] M. A. A. van Leeuwen, The Robinson-Schensted and Schützenberger algorithms, Part I: New combinatorial proofs, CWI report AM-R9208, (1992). This report is also electronically available via http://www.cwi.nl/cwi/publications/index.html#AM.
29. [vLee3] M. A. A. van Leeuwen, The Robinson-Schensted and Schützenberger algorithms, Part II: Geometric interpretations, CWI report AM-R.9209, (1992). This report is also electronically available via http://www.cwi.nl/cwi/publications/index.html#AM.
30. [vLee4] M. A. A. van Leeuwen, "Tableau algorithms defined naturally for pictures", in Formal Power Series and Algebraic Combinatorics, Abstracts for FPSAC '94, DIMACS, 1994. Full paper available electronically at ftp://ftp.cwi.nl/pub/pictures/fullpaper.tex.gz.
31. [LiRi] D. E. Littlewood and A. R. Richardson, "Group characters and algebra", Phil. Trans. A 233, (1934), 99-141.
32. nd edition, Oxford University Press, 1950.
33. T. McLarnan, Tableau recurrences and symmetric Schensted correspondences for ordinary, shifted, and oscillating tableaux, Thesis (UCSD), (1986).
34. [Oka1] S. Okada, "Wreath products by the symmetric groups and product posets of Young's lattice", J. Combin. Theory, Ser. A 55, (1990), 14-32.
35. [Oka2] S. Okada, "A Robinson-Schensted-type algorithm for SO(2n, C)", Journal of Algebra 142, (1991), 334-372.
36. [Pro] R. A. Proctor, "A Schensted algorithm which models tensor representations of the orthogonal group", Canad. J. Math. 42, (1990), 28-49.
37. [Rob] G. de B. Robinson, "On the representations of the symmetric group", American Journal of Math. 60, (1938), 745-760.
38. [Roby] T. W. Roby, Applications and extensions of Fomin's generalization of the Robinson-Schensted correspondence to differential posets, Thesis (M. I. T.), (1991).
39. [Sag1] B. E. Sagan, "An analog of Schensted's algorithm for shifted Young tableaux", J. Combin. Theory, Ser. A 27, (1979), 10-18.
40. [Sag2] B. E. Sagan, "The ubiquitous Young tableau", pp. 262-298 in Invariant theory and tableaux (D. Stanton, ed.), The IMA volumes in mathematics and its applications 19, Springer-Verlag, New York, 1990.
41. [SaSt] B. E. Sagan and R. P. Stanley, "Robinson-Schensted Algorithms for Skew Tableaux", J. Combin. Theory, Ser. A 55, (1990), 161-193.
42. [Sche] C. Schensted, "Longest increasing and decreasing subsequences", Canadian Journal of Math. 13, (1961), 179-191.
43. [Schü1] M. P. Schützenberger, "Quelques remarques sur une construction de Schensted", Math. Scandinavica 12, (1963), 117-128.
44. [Schü2] M. P. Schützenberger, "Promotion des morphismes d'ensembles ordonnés", Discrete Mathematics 2, (1972), 73-94.
45. [Schü3] M. P. Schützenberger, "La correspondence de Robinson", pp. 59-113 in Combinatoire et Représentation du Groupe Symétrique (D. Foata, ed.), Lecture Notes in Mathematics 579, 1976.
46. [Schü4] M. P. Schützenberger, "Evacuations", pp. 257-264 in Coll. Int. sulla Teorie Combinatorie, Tomo 1, Acad. Nazion. dei Lincei, Roma, 1976.
47. [Shim] M. Shimozono, Littlewood-Richardson rules for ordinary and projective representations of symmetric groups, Thesis (UCSD), (1991).
48. [Stan1] R. P. Stanley, "Some aspects of groups acting on finite posets", J. Combin. Theory, Ser. A 32, (1982), 132-161.
49. [Stan2] R. P. Stanley, Enumerative Combinatorics, Vol. 1, Wadsworth and Brooks/Cole, Pacific Grove, CA, 1986.
50. [Stan3] R. P. Stanley, "Differential posets", Journal of the Am. Math. Soc. 1, (1988), 919-961.
51. [StWhi] D. W. Stanton and D. E. White, "A Schensted algorithm for rim hook tableaux", J. Combin. Theory, Ser. A 40, (1985), 211-247.
52. [Stb] R. Steinberg, "An Occurrence of the Robinson-Schensted Correspondence", Journal of Algebra 113, (1988), 523-528.
53. n", J. Combin. Theory, Ser. A 46, (1987), 79-120.
54. [Sund1] S. Sundaram, On the combinatorics of representations of Sp(2n, C), Thesis (M. I. T.), (1986).
55. [Sund2] S. Sundaram, "Orthogonal tableaux and an insertion algorithm for SO(2n + 1)", J. Combin. Theory, Ser. A 53, (1990), 239-256.
56. [Ter] I. Terada, A Robinson-Schensted-type correspondence for a dual pair on spinors, to appear in J. Combin. Theory, Ser. A.
57. [Thom1] G. P. Thomas, "On a construction of Schü tzenberger", Discrete Mathematics 17, (1977), 107-118.
58. [Thom2] G. P. Thomas, "On Schensted's construction and the multiplication of Schur functions", J. Combin. Theory, Ser. A 32, (1982), 132-161.
59. [Vien] G. Viennot, "Une forme géométrique de la correspondance de Robinson-Schensted", pp. 29-68 in Combinatoire et Représentation du Groupe Symétrique (D. Foata, ed.), Lecture Notes in Mathematics 579, 1976.
60. [Vog] D. Vogan, "A generalised τ-invariant for thé primitive spectrum of a semisimple Lie-Algebra", Mathematische Annalen 242, (1979), 209-224.
61. [Whi] D. White, "Some connections between the Littlewood-Richardson rule and the construction of Schensted", J. Combin. Theory, Ser. A 30, (1981), 237-247.
62. [Zel] A. V. Zelevinsky, "A Generalisation of the Littlewood-Richardson Rule and the Robinson-Schensted-Knuth Correspondence" , Journal of Algebra 69, (1981), 82-94.