Generalized Foulkes' Conjecture and Tableaux Construction
Foulkes conjectured that for n=ab and a ≤ b, every irreducible module occurring as a constituent in 1<sub>Sb∫Sa</sub><sup>Sn</sup> occurs with greater or equal multiplicity in 1<sub>Sa∫Sb</sub><sup>Sn</sup>. We generalize part of this to say those irr...
Internet
https://thesis.library.caltech.edu/1870/14/FullThesis.pdfhttps://thesis.library.caltech.edu/1870/15/TableOfContents.pdf
https://thesis.library.caltech.edu/1870/2/Chapter1.pdf
https://thesis.library.caltech.edu/1870/5/Chapter2.pdf
https://thesis.library.caltech.edu/1870/6/Chapter3.pdf
https://thesis.library.caltech.edu/1870/7/Chapter4.pdf
https://thesis.library.caltech.edu/1870/8/Chapter5.pdf
https://thesis.library.caltech.edu/1870/9/Chapter6.pdf
https://thesis.library.caltech.edu/1870/10/Chapter7.pdf
https://thesis.library.caltech.edu/1870/11/Chapter8.pdf
https://thesis.library.caltech.edu/1870/12/Chapter9.pdf
https://thesis.library.caltech.edu/1870/3/Chapter10.pdf
https://thesis.library.caltech.edu/1870/4/Chapter11and12.pdf
https://thesis.library.caltech.edu/1870/1/AppendixA.pdf
Vessenes, Rebecca Angel (2004) Generalized Foulkes' Conjecture and Tableaux Construction. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/4C12-SV65. https://resolver.caltech.edu/CaltechETD:etd-05192004-121256 <https://resolver.caltech.edu/CaltechETD:etd-05192004-121256>