Algebra is Hard, Combinatorics is Simple(r)
Abstract
Questions in algebra, while deep and interesting, can be incredibly difficult. Thankfully, when studying the representation theory of the symmetric groups, one can often take algebraic properties and results and write them in the language of combinatorics; where one has a wide variety of tools and techniques to use. In this talk, we will look at the specific example of the submodule structure of 2-part Specht modules in characteristic 2, and answer which hook Specht modules are uniserial in characteristic 2. We will not need to assume the Riemann hypothesis for this talk.