Proceedings of the 28-th International Conference on Formal Power Series and Algebraic Combinatorics
4-8 Jul 2016 Vancouver, British Columbia (Canada)

Extended abstracts listed by author > Thiem Nathaniel

Friday 8
Combinatorics
Julien Courtiel
› 14:30 - 15:00 (30min)
› Djavad Mowafaghian Cinema
The generalized Gelfand–Graev characters of GLn(Fq)
Scott Andrews  1  , Nathaniel Thiem  2  
1 : Boise State University
2 : University of Colorado Boulder (USA)

Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, gener- alized 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 def- inition 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. 



  • Poster
Online user: 1