English

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

Representation Theory 2017-11-29 v1 Combinatorics

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 AA 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.

Keywords

Cite

@article{arxiv.1505.00763,
  title  = {The combinatorics of $\mathrm{GL}_n$ generalized Gelfand--Graev characters},
  author = {Scott Andrews and Nathaniel Thiem},
  journal= {arXiv preprint arXiv:1505.00763},
  year   = {2017}
}
R2 v1 2026-06-22T09:27:52.541Z