A color-to-spin domino Schensted algorithm

Electronic Journal of Combinatorics

Volumn 8, Issue 1 R, 2001, Pages 1-50

  Shimozono, Mark ^a   White, Dennis E ^b  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3242662672     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1565     Document Type: Article

References (30)

1. D. Barbasch and D. Vogan, Primitive ideals and orbital integrals on complex classical groups, Math. Ann. 259 (1982), pp. 153-199
2. A. Berenstein and A. Kirillov, Schützenberger involution and action of the symmetric group Proceedings of 10th International Conference on Formal Power Series and Algebraic Combinatorics, Fields Institute, Toronto, 1998
3. C. Carré and B. Leclerc, Splitting the square of a Schur function into its symmetric and antisymmetric parts, J. Alg. Combin. 4 (1995), pp. 201-231.
4. S. Fomin, Schensted algorithms for dual graded graphs, J. Algebraic Combin. 4 (1995), pp. 5-45.
5. S. Fomin and D. Stanton, Rim hook lattices, St. Petersburg Math. J. 9 (1998), pp. 1007-1016.
6. W. Fulton, Young Tableaux, London Mathematical Society, 1997.
7. D. Garfinkle, On the classification of primitive ideals for complex classical Lie algebras, I, Compositio Mathematica 75 (1990), pp. 135-169.
8. M. D. Haiman, On mixed insertion, symmetry, and shifted Young tableaux, J. Combin. Theory Ser. A 50 (1989), pp. 196-225.
9. G. James and A. Kerber, Representation Theory of the Symmetric Group, Addison Wesley, 1981.
10. D. Knuth, Permutations, matrices, and generalized Young tableaux, Pacific J. of Math. 34 (1970), pp. 709-727.
11. A. Lascoux, B. Leclerc and J.-Y. Thibon, Ribbon tableaux, Hall-Littlewood functions and unipotent varieties, Sém. Lothar. Combin., 34 (1995).
12. A. Lascoux and M. P. Schützenberger, Le monoïde plaxique, Non-Commutative Structures in Algebra and Geometric Combinatorics, Quaderni de "La ricerca scientifica," n. 109, Roma, CNR, (1981), pp. 129-156.
13. D. E. Littlewood, Modular representations of symmetric groups, Proc. Royal Soc. London Ser. A, 209 (1951), pp. 333-353.
14. I. Macdonald, Symmetric Functions and Hall Polynomials, Oxford University Press, 1995.
15. T. Nakayama, On some modular properties of irreducible representations of a symmetric group, I, Jap. J. Math. 18 (1941), pp. 89-108.
16. T. Nakayama, On some modular properties of irreducible representations of a symmetric group, II, Jap. J. Math. 17 (1941), pp. 411-423.
17. G. de B. Robinson, On the representations of the symmetric group, Amer. J. Math. 60 (1938), pp. 745-760.
18. G. de B. Robinson, On the representations of the symmetric group. III, Amer. J. Math. 70 (1948), pp. 277-294.
19. B. Sagan, The Symmetric Group, Wadsworth & Brooks/Cole, 1991.
20. C. Schensted, Longest increasing and decreasing subsequences, Canadian J. of Math. 13 (1961), pp. 179-191.
21. A. Schilling, M. Shimozono and D. White, Branching formula for q-Littlewood-Richardson coefficients, preprint,
22. M. Shimozono and D. White, Color-to-spin ribbon Schensted algorithms, Discrete Math., to appear.
23. M. P. Schützenberger, Quelques remarques sur une construction de Schensted, Math. Scandinavica 12 (1963), pp. 117-128.
24. R. Stanley, Enumerative Combinatorics, Vol 2 , Cambridge, 1999.
25. R. Stanley, Symmetries of plane partitions, J. Combin. Theory Ser. A 43 (1986), pp. 103-113.
26. D. Stanton and D. White, A Schensted algorithm for rim-hook tableaux, J. Combin. Theory Ser. A 40 (1985), pp. 211-247.
27. M. A. A. van Leeuwen, The Robinson-Schensted and Schützenberger algorithms, an elementary approach, Electronic J. of Combin. 3 (1996).
28. M. A. A. van Leeuwen, Several bijective correspondences involving domino tableaux, preprint.
29. D. White, Sign-balanced posets, J. Combin. Theory, Ser. A, to appear.
30. D. White, Some connections between the Littlewood-Richardson rule and the construction of Schensted, J. Combin. Theory, Ser. A 30 (1981), pp. 237-247.