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.

Highlights

  • There has been considerable progress in recent years on the combinatorial representation theory of finite unipotent groups

  • The representation theory of the maximal unipotent subgroup UTn(Fq) of the finite general linear group GLn(Fq) has developed from a wild problem to a combinatorial theory based on set partitions [And[95], Yan10]

  • By gluing together these theories we get a Hopf structure analogous to the representation theory of the symmetric groups Sn (where we replace the symmetric functions of Sn with symmetric functions in non-commuting variables for UTn(Fq)) [AAB+12]

Read more

Summary

Introduction

There has been considerable progress in recent years on the combinatorial representation theory of finite unipotent groups. The representation theory of the maximal unipotent subgroup UTn(Fq) of the finite general linear group GLn(Fq) has developed from a wild problem to a combinatorial theory based on set partitions [And[95], Yan10]. From this point of view, we could conduct all our constructions using known monomial representations of UTn(Fq). We hope this paper can give a road map for future constructions

Preliminaries
Set partition combinatorics
Supercharacter theories
A combinatorial version of Kawanaka’s construction
A characterization of generalized Gelfand-Graev characters
A supercharacter theory from non-nesting set partitions
From non-nesting supercharacters to GGG characters
The multiplicities of the unipotent characters
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call