Tableau algorithms defined naturally for pictures

Discrete Mathematics

Volumn 157, Issue 1-3, 1996, Pages 321-362

  Van Leeuwen, Marc A A ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002264972     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)83022-6     Document Type: Article

References (27)

1. M. Clausen, Multivariate polynomials, standard tableaux, and representations of symmetric groups, J. Symbolic Comput. 11 (1991) 483-522.
2. M. Clausen and F. Stötzer, Pictures and Standardtableaux, Bayreuther Math. Schriften 16 (1984) 1-122.
3. S.V. Fomin, Finite partially ordered sets and Young tableaux, Soviet Math. Dokl. 19 (1978) 1510-1514.
4. S.V. Fomin, Generalised Robinson-Schensted-Knuth correspondence, J. Soviet Math. 41 (1988) 979-991.
5. S. Fomin and C. Greene, A Littlewood-Richardson Miscellany, Eur. J. Combin. 14 (1993) 191-212.
6. C. Greene, An extension of Schensted's Theorem, Adv. Math. 14 (1974) 254-265.
7. C. Greene, Some partitions associated with a partially ordered set, J. Combin. Theory, Ser. A 20 (1976) 69-79.
8. M.D. Haiman, Dual equivalence with applications, including a conjecture of Proctor, Discrete Math. 99 (1992) 79-113.
9. P. Hanlon and S. Sundaram, On a bijection between Littlewood-Richardson fillings of conjugate shape, J. Combin. Theory, Ser. A 60 (1992) 1-18.
10. G.D. James and M. H. Peel, Specht series for skew representations of symmetric groups, J. Algebra 56 (1979) 343-364.
11. D.E. Knuth, Permutations, matrices and generalized Young tableaux, Pacific J. Math. 34 (1970) 709-727.
12. D.E. Knuth, The art of Computer Programming, Vol. III Sorting and Searching (Addison-Wesley, Reading, MA, 1975) 48-72.
13. A. Lascoux and M.P. Schützenberger, Le monoïde plaxique, Quad. Ricerca Scientifica C.N.R. 109 (1981) 129-156.
14. M.A.A. van Leeuwen, An even more symmetric form of Zelevinsky's pictures, in: Proc. 10, Kolloquium über Kombinatorik, Bielefeld (1990).
15. M.A.A. van Leeuwen, The Robinson-Schensted and Schützenberger algorithms, Part I: New combinatorial proofs, CWI Report AM-R9208, (1992) (Electronically available in ftp.cwi.nl: /pub/CWIreports/AM).
16. M.A.A. van Leeuwen, The Robinson-Schensted and Schützenberger algorithms, an elementary approach, Electronic J. Combin. 3, R15 (1996) 32pp.
17. nd edn. (Oxford University Press, Oxford, 1950).
18. I.G. Macdonald, Symmetric Functions and Hall Polynomials (Oxford Mathematical Monographs, Clarendon Press, Oxford, 1979).
19. G. de B. Robinson, On the representations of the symmetric group, Amer. J. Math. 60 (1938), 745-760.
20. B.E. Sagan, The ubiquitous Young tableau in: D. Stanton ed., Invariant Theory and Tableaux. The IMA volumes in mathematics and its applications, vol. 19 (Springer, New York 1990) 262-298.
21. C. Schensted, Longest increasing and decreasing subsequences, Can, J. Math. 13 (1961) 179-191.
22. M.P. Schützenberger, Quelques remarques sur une construction de Schensted, Math. Scandinavica 12 (1963) 117-128.
23. M.P. Schützenberger, La correspondance de Robinson, in: D. Foata, ed., Combinatoire et Représentation du Groupe Symétrique, Lecture Notes in Mathematics 579 (1976) 59-113
24. G. P. Thomas, On Schensted's construction and the multiplication of Schur functions, J. Combin. Theory, Ser. A 32 (1982) 132-161.
25. D. White, Some connections between the Littlewood-Richardson rule and the construction of Schensted, J. Combin. Theory, Ser. A 30 (1981) 237-247.
26. A.V. Zelevinsky, A Generalisation of the Littlewood-Richardson Rule and the Robinson-Schensted-Knuth Correspondence, J. Algebra 69 (1981) 82-94.
27. A.V. Zelevinsky, Representations of finite classical groups, a Hopf algebra approach, Lecture Notes in Mathematics, vol. 869 (Springer Berlin/New York 1981).