AbstractIt 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
In linear algebra, the minimal polynomial of an n-by-n matrix A over a field F is the monic polynomi...
AbstractWe present the conditions under which a symmetric circulant matrix C, with entries from a fi...
Abstract approved Redacted for Privacy (Major professor) This thesis has four main results. First we...
AbstractIt has been known for some time that every polynomial with coefficients from a finite field ...
It has been known for some time that every polynomial with coefficients from a finite field is the ...
Over a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-symmetric...
AbstractThis paper contains a general characterization for the permutation polynomials of the symmet...
AbstractOver a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-s...
It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ ...
AbstractOver a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-s...
AbstractWe show that given a polynomial, one can (without knowing the roots) construct a symmetric m...
AbstractIn this paper the author considers symmetric n × n matrices over a field F finite dimensiona...
This paper contains a general characterization for the permutation polynomials of the symmetric mat...
AbstractThe symmetric complexity of a polynomial in n variables is defined as the number of times th...
In linear algebra, the minimal polynomial of an n-by-n matrix A over a field F is the monic polynomi...
In linear algebra, the minimal polynomial of an n-by-n matrix A over a field F is the monic polynomi...
AbstractWe present the conditions under which a symmetric circulant matrix C, with entries from a fi...
Abstract approved Redacted for Privacy (Major professor) This thesis has four main results. First we...
AbstractIt has been known for some time that every polynomial with coefficients from a finite field ...
It has been known for some time that every polynomial with coefficients from a finite field is the ...
Over a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-symmetric...
AbstractThis paper contains a general characterization for the permutation polynomials of the symmet...
AbstractOver a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-s...
It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ ...
AbstractOver a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-s...
AbstractWe show that given a polynomial, one can (without knowing the roots) construct a symmetric m...
AbstractIn this paper the author considers symmetric n × n matrices over a field F finite dimensiona...
This paper contains a general characterization for the permutation polynomials of the symmetric mat...
AbstractThe symmetric complexity of a polynomial in n variables is defined as the number of times th...
In linear algebra, the minimal polynomial of an n-by-n matrix A over a field F is the monic polynomi...
In linear algebra, the minimal polynomial of an n-by-n matrix A over a field F is the monic polynomi...
AbstractWe present the conditions under which a symmetric circulant matrix C, with entries from a fi...
Abstract approved Redacted for Privacy (Major professor) This thesis has four main results. First we...