Gelfand-Graev characters of the finite unitary groups. (Q2380312): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0611010 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 06:12, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Gelfand-Graev characters of the finite unitary groups. |
scientific article |
Statements
Gelfand-Graev characters of the finite unitary groups. (English)
0 references
26 March 2010
0 references
The authors provide the values of the Gelfand-Graev characters of the finite unitary group at arbitrary elements, recover the decomposition multiplicities of degenerate Gelfand-Graev characters, and present some consequences regarding multiplicity. These results were obtained through the use of symmetric functions and combinatorial arguments. If \(B\) is a maximal unipotent subgroup of a finite group of Lie type \(G\), then the Gelfand-Graev character is obtained by inducing a generic linear character from \(B\) to \(G\). The degenerate Gelfand-Graev characters are obtained by inducing arbitrary linear characters. The authors build on the results of \textit{A. V. Zelevinsky} [Representations of finite classical groups. A Hopf algebra approach. Lect. Notes Math. 869. Berlin-Heidelberg-New York: Springer-Verlag (1981; Zbl 0465.20009)]. The authors use the characteristic map of the finite unitary group as their main combinatorial tool. The map translates the Deligne-Lusztig theory of finite unitary groups into symmetric functions and allow for combinatorial arguments to be used to establish the results. In Section 3, the authors study the non-degenerate Gelfand-Graev character and use the formula for the character values of the Gelfand-Graev character of \(\text{GL}(n,\mathbb{F}_q)\) to obtain a corresponding formula for \(\text{U}(n,\mathbb{F}_{q^2})\). Section 4 uses tableau combinatorics to compute the decomposition of degenerate Gelfand-Graev characters. The degenerate character decomposes as the sum over \(\lambda\) of nonnegative integer multiples of \(\chi^\lambda\), where \(\lambda\) is a multipartition. In Theorem 5.2, the authors give combinatorial conditions on the multipartition \(\lambda\) to guarantee that the irreducible character \(\chi^\lambda\) appears with multiplicity one in some degenerate Gelfand-Graev character.
0 references
Gelfand-Graev characters
0 references
symmetric functions
0 references
finite unitary groups
0 references
decomposition multiplicities
0 references
irreducible characters
0 references