Toggle Main Menu Toggle Search

Open Access padlockePrints

On types and classes of commuting matrices over finite fields

Lookup NU author(s): Dr John Britnell

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

This paper addresses various questions about pairs of similarity classes of matrices that contain commuting elements. In the case of matrices over finite fields, we show that the problem of determining such pairs reduces to a question about nilpotent classes; this reduction makes use of class types in the sense of Steinberg and Green. We investigate the set of scalars that arise as determinants of elements of the centralizer algebra of a matrix, providing a complete description of this set in terms of the class type of the matrix. Several results are established concerning the commuting of nilpotent classes. Classes that are represented in the centralizer of every nilpotent matrix are classified; this result holds over any field. Nilpotent classes are parametrized by partitions; we find pairs of partitions whose corresponding nilpotent classes commute over some finite fields, but not over others. We conclude by classifying all pairs of classes, parametrized by two-part partitions, that commute. Our results on nilpotent classes complement work of Oblak and of Košir and Oblak. © 2011 London Mathematical Society.


Publication metadata

Author(s): Britnell JR, Wildon M

Publication type: Article

Publication status: Published

Journal: Journal of the London Mathematical Society

Year: 2011

Volume: 83

Issue: 2

Pages: 470-492

Print publication date: 01/04/2011

Online publication date: 16/02/2011

ISSN (print): 0024-6107

ISSN (electronic): 1469-7750

Publisher: John Wiley and Sons Ltd

URL: https://doi.org/10.1112/jlms/jdq088

DOI: 10.1112/jlms/jdq088


Altmetrics

Altmetrics provided by Altmetric


Share