The generalized Gelfand-Graev characters of GLn(Fq)

Scott Andrews, Nathaniel Thiem

Research output: Contribution to journalConference articlepeer-review

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.

Original languageEnglish
Pages (from-to)49-60
Number of pages12
JournalDiscrete Mathematics and Theoretical Computer Science
StatePublished - 2016
Event28th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2016 - Vancouver, Canada
Duration: 4 Jul 20168 Jul 2016

Keywords

  • Kostka polynomial
  • Supercharacter
  • Unipotent representation

Fingerprint

Dive into the research topics of 'The generalized Gelfand-Graev characters of GLn(Fq)'. Together they form a unique fingerprint.

Cite this