Abstract
A classical conjecture by Graham Higman states that the number of conjugacy classes of , the group of upper triangular matrices over , is polynomial in , for all . In this paper we present both positive and negative evidence, verifying the conjecture for , and suggesting that it probably fails for . 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.