Some bijective correspondences involving domino tableaux

Electronic Journal of Combinatorics

Volumn 7, Issue 1 R, 2000, Pages 1-25

  Van Leeuwen, Marc A A ^a  

^a UNIVERSITÉ DE POITIERS   (France)

Author keywords

Bijective proof; Domino tableau

Indexed keywords

EID: 4043106165     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1513     Document Type: Article

References (19)

1. [BeSoSt] G. Benkart, F. Sottile, J. Stroomer, "Tableau switching: algorithms and applications", J. Combin. Theory, Ser. A 76, (1996), 11-43.
2. [CaLe] C. Carré and B. Leclerc, "Splitting the square of a Schur function into its symmetric and antisymmetric parts", J. of algebraic combinatorics 4, (1995), 201-231.
3. [FomSt] S. Fomin and D. Stanton, "Rim hook lattices", St. Petersburg Math. Journal 9, (1998), 1007-1016.
4. [Garf] D. Garfinkle, "On the classification of primitive ideals for complex classical Lie Algebra's, II", Compositio Mathematica 81, (1992), 307-366.
5. [KaNa] M. Kashiwara and T. Nakashima, "Crystal graphs for representations of the q-analogue of classical Lie algebras", Journal of Algebra 165, (1994), 295-345.
6. [Knuth] D. E. Knuth, "Permutations, matrices and generalized Young tableaux", Pacific Journal of Math. 34,(1970), 709-727.
7. [LaSch] A. Lascoux and M. P. Schu÷tzenberger, "Le monoï plaxique", Quad. Ricerca Scientifica C.N.R. 109, (1981), 129-156.
8. [LeTh] B. Leclerc and J.-Y. Thibon, "The Robinson-Schensted correspondence, crystal bases, and the quantum straightening at q = 0", Electronic J. of Combinatorics 3 (no. 2), R11, (1996), 24 pp.
9. [vLee1] M. A. A. van Leeuwen, "The Robinson-Schensted and Schützenberger algorithms, an elementary approach", Electronic J. of Combinatorics 3 (no. 2), R15, (1996), 32 pp.
10. [vLee2] M. A. A. van Leeuwen, "Tableau algorithms defined naturally for pictures", Discrete Mathematics 157, (1996), 321-362.
11. [vLee3] M. A. A. van Leeuwen, "Edge sequcences, ribbon tableaux, and an action of affine permutations", European J. of Combinatorics 20, (1999), 179-195.
12. [vLee4] M. A. A. van Leeuwen, "An analogue of jeu de taquin for Littelmann's crystal paths", Seminaire Lotharingien de Combinatoire B41b, (1998), 23 pp.
13. [vLee5] M. A. A. van Leeuwen, The Littlewood-Richardson rule, and related combinatorics, math.CO/9908099, Submitted to Math. Soc. of Japan Memoirs.
14. [Litm1] P. Littelmann, "A Littlewood-Richardson rule for symmetrizable Kac-Moody algebras", Inventiones mathematicae 116, (1994), 329-346.
15. [Litm2] P. Littelmann, "A plactic algebra for semisimple Lie algebras", Advances in Math. 124 (2), (Dec. 1996), 312-331.
16. [Litw] D. E. Littlewood, "Modular representations of symmetric groups", Proc. Royal Soc. A 209, (1951), 333-353.
17. [Macd] I. G. Macdonald, Symmetric Functions and Hall Polynomials, Oxford Mathematical Monographs, Clarendon press, Oxford, 1979.
18. [Rob] G. de B. Robinson, "On the representations of the symmetric group", American Journal of Math. 60, (1938), 745-760.
19. [StWhi] D. W. Stanton and D. E. White, "A Schensted algorithm for rim hook tableaux", J. Combin. Theory, Ser. A 40, (1985), 211-247.