Hostname: page-component-5d59c44645-ndqjc Total loading time: 0 Render date: 2024-03-04T15:39:09.441Z Has data issue: false hasContentIssue false

Ordering the Representations of ${{S}_{n}}$ Using the Interchange Process

Published online by Cambridge University Press:  20 November 2018

Gil Alon
Division of Mathematics, The Open University of Israel, Raanana 43107, Israel e-mail:
Gady Kozma
Department of Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel e-mail:
Rights & Permissions [Opens in a new window]


Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Inspired by Aldous' conjecture for the spectral gap of the interchange process and its recent resolution by Caputo, Liggett, and Richthammer, we define an associated order $\prec $ on the irreducible representations of ${{S}_{n}}$. Aldous' conjecture is equivalent to certain representations being comparable in this order, and hence determining the “Aldous order” completely is a generalized question. We show a few additional entries for this order.

Research Article
Copyright © Canadian Mathematical Society 2013


[1] Alon, G. and Kozma, G., The probability of long cycles in the interchange processes. Preprint (2010). arxiv:1009:3723v2 Google Scholar
[2] Bacher, R., Valeur propre minimale du laplacien de Coxeter pour le groupe sym´etrique. J. Algebra 167 (1994), no. 2, 460472. Google Scholar
[3] Caputo, P., T. M. Liggett, and Richthammer, T., Proof of Aldous’ spectral gap conjecture. J. Amer. Math. Soc. 23 (2010), no. 3, 831851. Google Scholar
[4] Cesi, F., On the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions. J. Algebraic Combin. 32 (2010), no. 2, 155185. Google Scholar
[5] Diaconis, P. and Shahshahani, M., Generating a random permutation with random transpositions. Z.Wahrsch. Verw. Gebiete 57 (1981), no. 2, 159179. Google Scholar
[6] Dieker, A. B., Interlacings for random walks on weighted graphs and the interchange process. SIAM J. Discrete Math. 24 (2010), no. 1, 191–206. Google Scholar
[7] Fulton, W. and Harris, J., Representation Theory. A First Course. Graduate Texts in Mathematics 129. Springer-Verlag, New York, 1991.Google Scholar
[8] D. M. Goldschmidt, Group Characters, Symmetric Functions, and the Hecke Algebra. University Lecture Series 4. American Mathematical Society, Providence, RI, 1993.Google Scholar
[9] Handjani, S. and Jungreis, D., Rate of convergence for shuffling cards by transpositions. J. Theoret. Probab. 9 (1996), no. 4, 983993. Google Scholar
[10] James, G. and Kerber, A., The representation theory of the symmetric group.. Encyclopedia of Mathematics and its Applications 16. Addison-Wesley, Reading, MA, 1981.Google Scholar
[11] Molev, A. I., Gelfand-Tsetlin bases for classical Lie algebras. In: Handbook of Algebra. Vol. 4, Elsevier/North-Holland, Amsterdam, 2006, pp. 109170.Google Scholar
[12] Morris, B., Spectral gap for the interchange process in a box. Electron. Commun. Probab. 13 (2008), 311318.Google Scholar
[13] Okounkov, A. and Vershik, A., A new approach to representation theory of symmetric groups. Selecta Math. 2 (1996), no. 4, 581605. Google Scholar
[14] Sagan, , The Symmetric Group. Representations, Combinatorial Algorithms, and Symmetric Functions. Second edition. Graduate Texts in Mathematics 203. Springer-Verlag, New York, 2001.Google Scholar
[15] Starr, S. and Conomos, M., Asymptotics of the Spectral Gap for the Interchange Process on Large Hypercubes. Preprint (2008). arxiv:0802.1368 Google Scholar