2000 character limit reached
Depth Zero Supercuspidal Representations of Classical Groups into L-packets: the Typically Almost Symmetric Case
Published 7 Dec 2023 in math.RT and math.NT | (2312.04061v1)
Abstract: We classify what we call ``typically almost symmetric'' depth zero supercuspidal representations of classical groups into L-packets. Our main results resolve an ambiguity in the paper of Lust-Stevens \cite{Lust-Stevens} in this case, where they could only classify these representations in two or four, if not one, L-packets. By assuming the expected numbers of supercuspidal representations in the L-packets, we employ only simple properties of the representations to prove the main results. In particular, we do not require any deep calculations of character values.
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.