vix.ing · top · new · best · stats

Representations of Finite Unipotent Linear Groups by the Method of Clusters

2010/04/15 by Ning Yan, Yan, Ning · 3 citations
Computer Science · Mathematics · #Advanced Algebra and Geometry #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Representation Theory (math.RT) #math.CO #math.RT

paper · pdf · doi:10.48550/arxiv.1004.2674

The first version of this paper dates back to 2001, and served as my Ph.D. dissertation. The current version was perpared in 2006. A more updated version is likely to appear some time after the AIM workshop on Supercharacter Theory and Combinatorial Hopf Algebra, to be held in Palo Alto in May, 2010.

arxiv created 2010/04/15 · openalex publication_date 2010/04/15 · arxiv updated 2010/04/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The general linear group GL(n, K) over a field K contains a particularly prominent subgroup U(n, K), consisting of all the upper triangular unipotent elements. In this paper we are interested in the case when K is the finite field Fq, and our goal is to better understand the representation theory of U(n, Fq). The complete classification of the complex irreducible representations of this group has long been known to be a difficult task. The orbit method of Kirillov, famous for its success when K has characteristic 0, is a natural source of intuition and conjectures, but in our case the relation between coadjoint orbits and complex representations is still a mystery. Here we introduce a natural variant of the orbit method, in which the central role is played by certain clusters of coadjoint orbits. This "method of clusters" leads to the construction of a subring in the representation ring of U(n, Fq) that is rich in structure but pleasantly comprehensible. The cluster method also has many of the major features one would expect from the philosophy of orbit method.

Cited by

Related