Finite Theta Correspondence of Almost Characters

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 (2n,2n') or (2n,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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…