Pith. sign in

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

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

citation-role summary

background 1

citation-polarity summary

fields

math.PR 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

background 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.