On Higman's k(Un(Fq)) conjecture
Abstract
A classical conjecture by Graham Higman states that the number of conjugacy classes of Un(q), the group of upper triangular n× n matrices over Fq, is polynomial in q, for all n. In this paper we present both positive and negative evidence, verifying the conjecture for n 16, and suggesting that it probably fails for n 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 pattern groups. These relations are proved by the orbit method for finite nilpotent groups. Other applications are also discussed.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.