Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Multiplicity-free Representations of Algebraic Groups
 
research article

Multiplicity-free Representations of Algebraic Groups

Liebeck, Martin W.
•
Seitz, Gary M.
•
Testerman, Donna M.  
February 1, 2024
Memoirs Of The American Mathematical Society

Let K be an algebraically closed field of characteristic zero, and let G be a connected reductive algebraic group over K. We address the problem of classifying triples (G, H, V ), where H is a proper connected subgroup of G, and V is a finitedimensional irreducible G -module such that the restriction of V to H is multiplicityfree - that is, each of its composition factors appears with multiplicity 1. A great deal of classical work, going back to Dynkin, Howe, Kac, Stembridge, Weyl and others, and also more recent work of the authors, can be set in this context. In this paper we determine all such triples in the case where H and G are both simple algebraic groups of type A, and H is embedded irreducibly in G. While there are a number of interesting familes of such triples (G, H, V ), the possibilities for the highest weights of the representations defining the embeddings H < G and G < GL(V) are very restricted. For example, apart from two exceptional cases, both weights can only have support on at most two fundamental weights; and in many of the examples, one or other of the weights corresponds to the alternating or symmetric square of the natural module for either G or H.

  • Details
  • Metrics
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés