Symmetric Group Branching Rules and Tableaux
If \(G \supset H\) are groups, a branching rule is an explicit description of how representations of G decompose into irreducibles when restricted to H. By Frobenius reciprocity, this is equivalent to asking how representations of H decompose into irreducibles on induction to G. In this chapter, we will obtain the branching rule for the symmetric groups.
- 53.W. Fulton. Young Tableaux, with applications to representation theory and geometry, volume 35 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge, 1997.Google Scholar
- 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
- 124.I. Macdonald. Symmetric Functions and Hall Polynomials. Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York, second edition, 1995. With contributions by A. Zelevinsky, Oxford Science Publications.Google Scholar
- 126.L. Manivel. Symmetric Functions, Schubert Polynomials and Degeneracy Loci, volume 6 of SMF/AMS Texts and Monographs. American Mathematical Society, Providence, RI, 2001. Translated from the 1998 French original by John R. Swallow, Cours Spécialisés [Specialized Courses], 3.Google Scholar
- 141.B. Sagan. The Symmetric Group, representations, combinatorial algorithms, and symmetric functions, volume 203 of Graduate Texts in Mathematics. Springer-Verlag, New York, second edition, 2001.Google Scholar
- 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