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 computational flexibility. 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.
| Original language | English |
|---|---|
| Pages (from-to) | 475-499 |
| Number of pages | 25 |
| Journal | Journal of the London Mathematical Society |
| Volume | 95 |
| Issue number | 2 |
| DOIs | |
| State | Published - Apr 2017 |
Keywords
- 05E99
- 20C33 (primary)
Fingerprint
Dive into the research topics of 'The combinatorics of GL n generalized Gelfand-Graev characters'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver