Papers
Topics
Authors
Recent
Search
2000 character limit reached

The combinatorics of $\mathrm{GL}_n$ generalized Gelfand--Graev characters

Published 4 May 2015 in math.RT and math.CO | (1505.00763v1)

Abstract: Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, generalized Gelfand--Graev characters have remained somewhat mysterious. Even in the case of the finite general linear groups, the combinatorics of their decompositions has not been worked out. This paper re-interprets Kawanaka's definition in type $A$ in a way that gives far more flexibility in computations. We use these alternate constructions to show how to obtain generalized Gelfand--Graev representations directly from the maximal unipotent subgroups. We also explicitly decompose the corresponding generalized Gelfand--Graev characters in terms of unipotent representations, thereby recovering the Kostka--Foulkes polynomials as multiplicities.

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 (2)

Collections

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