The generalized Gelfand–Graev characters of GLn(Fq)
Discrete mathematics & theoretical computer science, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016), DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) (2020).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2020_special_379_a88,
     author = {Andrews, Scott and Thiem, Nathaniel},
     title = {The generalized {Gelfand{\textendash}Graev} characters of {GLn(Fq)}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)},
     year = {2020},
     doi = {10.46298/dmtcs.6406},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6406/}
}
TY  - JOUR
AU  - Andrews, Scott
AU  - Thiem, Nathaniel
TI  - The generalized Gelfand–Graev characters of GLn(Fq)
JO  - Discrete mathematics & theoretical computer science
PY  - 2020
VL  - DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6406/
DO  - 10.46298/dmtcs.6406
LA  - en
ID  - DMTCS_2020_special_379_a88
ER  - 
%0 Journal Article
%A Andrews, Scott
%A Thiem, Nathaniel
%T The generalized Gelfand–Graev characters of GLn(Fq)
%J Discrete mathematics & theoretical computer science
%D 2020
%V DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6406/
%R 10.46298/dmtcs.6406
%G en
%F DMTCS_2020_special_379_a88
Andrews, Scott; Thiem, Nathaniel. The generalized Gelfand–Graev characters of GLn(Fq). Discrete mathematics & theoretical computer science, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016), DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) (2020). doi : 10.46298/dmtcs.6406. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6406/

Cité par Sources :