University of Birmingham > Talks@bham > Algebra Seminar > Foulkes characters: deflations, twists and algorithms

## Foulkes characters: deflations, twists and algorithmsAdd to your list(s) Download to your calendar using vCal - Mark Wildon, Royal Holloway, University of London
- Tuesday 15 July 2014, 16:30-17:30
- Watson Building, Lecture Room A.
If you have a question about this talk, please contact David Craven. Conference: Representations of Symmetric Groups, Hecke Algebras and KLR Algebras Let φ mn} into n sets each of size m. A fundamental problem in algebraic combinatorics asks for the decomposition of φ^{(mn)} into irreducible characters. Closely related is Foulkes’ Conjecture, which states that φ^{(mn)} contains φ^{(nm)} whenever m_≤_n.My talk will begin with a deflation map that sends characters of S, via characters of the wreath product of _{n}S by _{m}S. This deflation map leads to a new algorithm for decomposing Foulkes characters that has been used to verify Foulkes’ Conjecture when _{n}m+n≤19. I will then state a combinatorial rule giving the values of the deflations of irreducible characters of S and show that this rule generalises the Murnaghan–Nakayama rule and Young’s rule. This is joint work with Anton Evseev and Rowena Paget._{mn}For each partition ν of This talk is part of the Algebra Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsSpeech Recognition by Synthesis Seminars Nuclear physics seminars Theoretical computer science seminar## Other talksI2S Seminar MSBC Seminar Nonlinear Optical Metasurfaces: From Enhanced Light-Matter-Interaction to Full Phase Tailoring School Seminar Adhesion lithography as a versatile nonapatterning tool for advanced optoelectronic devices Computational discovery of molecular materials |