The number of conjugacy classes in pattern groups is not a polynomial function. (Q2882813)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6031518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of conjugacy classes in pattern groups is not a polynomial function. |
scientific article; zbMATH DE number 6031518 |
Statements
7 May 2012
0 references
numbers of conjugacy classes
0 references
pattern groups
0 references
polynomial functions
0 references
0 references
The number of conjugacy classes in pattern groups is not a polynomial function. (English)
0 references
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\).
0 references
0.8328279256820679
0 references
0.8197882175445557
0 references
0.817571759223938
0 references
0.8002666234970093
0 references
0.7986632585525513
0 references
