Home The number of conjugacy classes in pattern groups is not a polynomial function
Article
Licensed
Unlicensed Requires Authentication

The number of conjugacy classes in pattern groups is not a polynomial function

  • Zoltán Halasi EMAIL logo and Péter P. Pálfy
Published/Copyright: March 15, 2011
Journal of Group Theory
From the journal Volume 14 Issue 6

Abstract

A famous open problem due to Graham Higman asks if the number of conjugacy classes in the group of n × n unipotent upper triangular matrices over the q-element field can be expressed as a polynomial function of q for every fixed n. We 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.

Received: 2010-08-18
Revised: 2010-11-22
Published Online: 2011-03-15
Published in Print: 2011-November

© de Gruyter 2011

Downloaded on 30.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jgt.2010.081/html?lang=en
Scroll to top button