The combinatorics of GL n generalized Gelfand-Graev characters

From MaRDI portal
Publication:5357271

DOI10.1112/JLMS.12023zbMATH Open1370.05216arXiv1505.00763OpenAlexW3124432383MaRDI QIDQ5357271FDOQ5357271


Authors: Scott Andrews, Nathaniel Thiem Edit this on Wikidata


Publication date: 14 September 2017

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1505.00763




Recommendations





Cited In (13)





This page was built for publication: The combinatorics of GL n generalized Gelfand-Graev characters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357271)