Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lusztig correspondence and the Gan-Gross-Prasad problem

Published 29 Apr 2021 in math.RT | (2104.14473v2)

Abstract: The Gan-Gross-Prasad problem is to describe the restriction of representations of a classical group $G$ to smaller groups $H$ of the same kind. In this paper, we solved the Gan-Gross-Prasad problem over finite fields completely. In previous work \cite{LW1,LW2,LW3,Wang}, we study the Gan-Gross-Prasad problem for unipotent representations of finite classical groups. The main tools used are the Lusztig correspondence as well as a formula of Reeder \cite{R} for the pairings of Deligne-Lusztig characters. We give a reduction decomposition of Reeder's formula, and deduce the Gan-Gross-Prasad problem for arbitrary representations from the unipotent representations by Lusztig correspondence.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.