On Higman's $k(U_n({\mathbb{F}}_q))$ conjecture

Abstract

A classical conjecture by Graham Higman states that the number of conjugacy classes of $U_n(q)$, the group of upper triangular $n\times n$ matrices over ${\mathbb{F}}_q$, is polynomial in $q$, for all $n$. In this paper we present both positive and negative evidence, verifying the conjecture for $n\le 16$, and suggesting that it probably fails for $n\ge 59$. The tools are both theoretical and computational. We introduce a new framework for testing Higman's conjecture, which involves recurrence relations for the number of conjugacy classed of \emph{pattern groups}. These relations are proved by the \emph{orbit method} for finite nilpotent groups. Other applications are also discussed.

References in corpus (2)

• Hopf monoids from class functions on unitriangular matrices
• Combinatorial methods of character enumeration for the unitriangular group

Cited by in corpus (7)

• The average size of the kernel of a matrix and orbits of linear groups
• The generic character table of a Sylow $p$-subgroup of a finite Chevalley group of type $D_4$
• Supercharacter theories for Sylow $p$-subgroups of Lie type $G_2$
• Supercharacter theories for Sylow $p$-subgroups of the Ree groups
• Commuting matrices and volumes of linear stacks
• The modality of a Borel subgroup in a simple algebraic group of type $E_8$
• Rook placements and Jordan forms of upper-triangular nilpotent matrices