Lie Groups pp 445-454 | Cite as

The Involution Model for Sk

  • Daniel Bump
Part of the Graduate Texts in Mathematics book series (GTM, volume 225)


Let σ 1 = 1, σ 2 = (12), σ 3 = (12)(34), be the conjugacy classes of involutions in S k . It was shown by Klyachko and by Inglis et al. [82] that it is possible to specify a set of characters \(\psi _{1},\psi _{2},\psi _{3},\ldots\) of degree 1 of the centralizers of \(\sigma _{1},\sigma _{2},\sigma _{3},\ldots\) such that the direct sum of the induced representations of the \(\psi_i\) contains every irreducible representation exactly once. In the next chapter, we will see that translating this fact and related ones to the unitary group gives classical facts about symmetric and exterior algebra decompositions due to Littlewood [120].


  1. 52.
    G. Frobenius and I. Schur. Über die rellen Darstellungen der endlichen Gruppen. S’ber. Akad. Wiss. Berlin, 186–208, 1906.Google Scholar
  2. 57.
    R. Gow. Properties of the characters of the finite general linear group related to the transpose-inverse involution. Proc. London Math. Soc. (3), 47(3):493–506, 1983.Google Scholar
  3. 82.
    N. Inglis, R. Richardson, and J. Saxl. An explicit model for the complex representations of s n. Arch. Math. (Basel), 54:258–259, 1990.Google Scholar
  4. 96.
    N. Kawanaka and H. Matsuyama. A twisted version of the Frobenius-Schur indicator and multiplicity-free permutation representations. Hokkaido Math. J., 19(3):495–508, 1990.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 103.
    A. Klyachko. Models for complex representations of groups GL(n, q). Mat. Sb. (N.S.), 120(162)(3):371–386, 1983.Google Scholar
  6. 109.
    D. Knuth. The Art of Computer Programming. Volume 3, Sorting and Searching. Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1973. Addison-Wesley Series in Computer Science and Information Processing.Google Scholar
  7. 120.
    D. Littlewood. The Theory of Group Characters and Matrix Representations of Groups. Oxford University Press, New York, 1940.Google Scholar
  8. 153.
    R. Stanley. Enumerative Combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin.Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Daniel Bump
    • 1
  1. 1.Department of MathematicsStanford UniversityStanfordUSA

Personalised recommendations