Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The generalized Gelf ...
Conference paper

The generalized Gelfand–Graev characters of GLn(Fq)

Scott Andrews (1), Nathaniel Thiem (2)
(1) Boise State University
(2) University of Colorado [Boulder]
Download article
Open on HAL
Imported on
July 4, 2016
Published on
April 22, 2020
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
DOI
10.46298/dmtcs.6406
License
https://about.hal.science/hal-authorisation-v1
Indicators
586
Views
1102
Downloads

The generalized Gelfand–Graev characters of GLn(Fq)

Scott Andrews (1), Nathaniel Thiem (2)
(1) Boise State University
(2) University of Colorado [Boulder]
Abstract
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.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Preview
Loading PDF preview...