The number of conjugacy classes in pattern groups is not a polynomial function.
From MaRDI portal
A famous open problem due to Graham Higman asks if the number of conjugacy classes in the group of \(n\times n\) unipotent upper triangular matrices over the \(q\)-element field can be expressed as a polynomial function of \(q\) for every fixed \(n\). In this paper, the authors consider the generalization of the problem for pattern groups and prove that for some pattern groups of nilpotency class two the number of conjugacy classes is not a polynomial function of \(q\).
Recommendations
Cites work
Cited in
(9)- Irreducible constituents of minimal degree in supercharacters of the finite unitriangular groups.
- On the coadjoint orbits of maximal unipotent subgroups of reductive groups.
- On the characters of the Sylow \(p\)-subgroups of untwisted Chevalley groups \(Y_{n}(p^{a})\)
- Upper bounds on the number of conjugacy classes in unitriangular groups.
- Representations of McLain groups
- Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints
- A conjecture about characters of finite pattern groups
- A geometric approach to polynomial property for pattern subgroups in \(\mathrm{U}_{a,b,c,d}\)
- The Hopf monoid on nonnesting supercharacters of pattern groups
This page was built for publication: The number of conjugacy classes in pattern groups is not a polynomial function.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882813)