COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Junior Algebra/Logic/Number Theory seminar > Towards an upper bound for the number of composition factors of Specht modules.

## Towards an upper bound for the number of composition factors of Specht modules.Add to your list(s) Download to your calendar using vCal - Diego Millan Berdasco, Queen Mary University of London
- Friday 16 November 2018, 15:00-16:00
- CMS, MR14.
If you have a question about this talk, please contact Stacey Law. The most important open problem in the modular representation theory of the symmetric group is finding the number and multiplicity of the composition factors of the Specht modules. In characteristic 0 these are just the simple modules of FSn, but in positive characteristic they may no longer be simple. We will survey the rich interplay between representation theory and combinatorics of partitions with the goal to show our ongoing work in obtaining an upper bound for certain Specht modules. We will conjecture how to extend this to all Specht modules. This talk is part of the Junior Algebra/Logic/Number Theory seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- CMS, MR14
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Junior Algebra/Logic/Number Theory seminar
- School of Physical Sciences
- bld31
- ndb35's list
Note that ex-directory lists are not shown. |
## Other listsBetty & Gordon Moore Library Events Neuroscience ReproSoc## Other talksREAL WORLD DRIVING EMISSIONS AROUND CAMBRIDGE AND LONDON Mountains, rivers and forests: the colonial mapping of southeast Asia, between observation and vernacular cartography in the 19th century Past and Prospective Transitions in the UK Gas Industry – Some Interdisciplinary Insights The Ethics of Artificially Intelligent Communications Technology Mixing time for the non-babktracking random walk on random graphs with communities Mechanisms of forgetting |