The generalized Gelfand–Graev characters of GLn(Fq) - Archive ouverte HAL
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2020

The generalized Gelfand–Graev characters of GLn(Fq)

Résumé

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.
Fichier principal
Vignette du fichier
final_25.pdf (339.25 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-02173756 , version 1 (04-07-2019)

Identifiants

Citer

Scott Andrews, Nathaniel Thiem. The generalized Gelfand–Graev characters of GLn(Fq). 28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6406⟩. ⟨hal-02173756⟩
35 Consultations
787 Téléchargements

Altmetric

Partager

More