Similarity to Symmetric Matrices over Finite Fields

Authors: Brawley J.V.¹; Wan T.Z-X.C.

Source: Finite Fields and Their Applications, Volume 4, Number 3, July 1998 , pp. 261-274(14)

Publisher: Academic Press

Key:

- Free Content

- New Content

- Subscribed Content

- Free Trial Content

Abstract:

It has been known for some time that every polynomial with coefficients from a finite field is the minimum polynomial of a symmetric matrix with entries from the same field. What have remained unknown, however, are the possible sizes for the symmetric matrices with a specified minimum polynomial and, in particular, the least possible size. In this paper we answer these questions using only the prime factorization of the given polynomial. Closely related is the question of whether or not a given matrix over a finite field is similar to a symmetric matrix over that field. Although partial results on that question have been published before, this paper contains a complete characterization. Copyright 1998 Academic Press.

Language: English

Document Type: Research article

Affiliations: 1: Clemson University, Clemson, South Carolina, 29631

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$56.00 plus tax