Increasing subsequences and the classical groups

Electronic Journal of Combinatorics

Volumn 5, Issue 1, 1998, Pages

  Rains, E M ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 10044262136     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1350     Document Type: Article

References (17)

1. Aldous, D. and Diaconis, P., Hammersley's interacting particle process and longest increasing subsequences, Prob. Th. and Rel. Fields 103 (1995), no. 2, 199-213.
2. Barbasch, D. and Vogan, D., Primitive ideals and orbital integrals in complex classical groups, Math. Ann. 259 (1982), 153-199.
3. Cohen, P. S. and Regev, A., Asymptotics of combinatorial sums and the central limit theorem, SIAM J. Math. Anal. 19 (1988), no. 5, 1204-1215.
4. Diaconis, P. and Shahshahani, M., On the Eigenvalues of Random Matrices, J. Appl. Prob. 31 (1994), 49-61.
5. Hammersley, J. M., A few seedlings of research, Proc. Sixth Berkeley Symp. Math. Statist. and Probability, vol. 1, University of California Press, Berkeley, Calif., 1972, pp. 345-394.
6. Johansson, K., The longest increasing subsequence in a random permutation and a unitary random matrix model (to appear).
7. Kirillov, A. N., Lascoux, A., Leclerc, B., and Thibon, J-Y., Séries génératrices pour les tableaux de dominos, C. R. Acad. Sci. Paris Sér. I Math. 318 (1994), no. 5, 395-400.
8. Knuth, D. E., The Art of Computer Programming, vol. 3: Sorting and Searching, 2nd. ed., Addison Wesley, Reading, Mass., 1973.
9. Mehta, M. L., Random Matrices, 2nd ed., Academic Press, Boston, Mass., 1991.
10. Odlyzko, A. M., Poonen, B., Widom, H. and Wilf, H. S., On the distribution of longest increasing subsequences in random permutations, in preparation.
11. Rains, E. M., Topics in Probability on Compact Lie Groups, Ph.D. thesis, Harvard University, Cambridge, Mass., 1995.
12. Regev, A., Asymptotic values for degrees associated with strips of young diagrams, Adv. in Math. 41 (1981), 115-136.
13. Sagan, B., The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions, Wadsworth & Brooks/Cole, Pacific Grove, Calif., 1991.
14. Schützenberger, M. P., Quelqes remarques sur une construction de Schensted, Math. Scand. 12 (1963), 117-128.
15. Stanton, D. W. and White, D. E., A Schensted Algorithm for Rim Hook Tableaux, J. Comb. Th., series A 40 (1985), 211-247.
16. Weyl, H., Classical Groups, Princeton University Press, Princeton, N.J., 1942.
17. n, Adv. in Math. 50 (1983), 160-186.