2000 character limit reached
Modular irreducibility of cuspidal unipotent characters (1611.07373v2)
Published 22 Nov 2016 in math.RT and math.GR
Abstract: We prove a long-standing conjecture of Geck which predicts that cuspidal unipotent characters remain irreducible after $\ell$-reduction. To this end, we construct a progenerator for the category of representations of a finite reductive group coming from generalised Gelfand--Graev representations. This is achieved by showing that cuspidal representations appear in the head of generalised Gelfand--Graev representations attached to cuspidal unipotent classes, as defined and studied in \cite{GM96}.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.