2000 character limit reached
Finite Theta Correspondence of Almost Characters
Published 2 Aug 2022 in math.RT | (2208.01246v1)
Abstract: The theory of almost characters which is closely related to character sheaves is proposed by Lusztig to study the representation theory of finite reductive groups. In this article we show that the decomposition of the Weil character for finite reductive dual pairs $(\Sp_{2n},\rmO\pm_{2n'})$ or $(\Sp_{2n},\SO_{2n'+1})$ with respect to the almost characters is exactly the same as the decomposition with respect to the irreducible characters. As a consequence, the finite theta correspondence on almost characters is established.
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.