Is every matrix similar to a polynomial in a companion matrix?
Natalio H. Guersenzvaig, Fernando Szechtman

TL;DR
This paper investigates whether every matrix over a finite field can be expressed as a polynomial in a companion matrix, providing affirmative results under certain conditions, and develops algorithms for matrix similarity and subalgebra structure analysis.
Contribution
The paper proves that over finite fields with size at least n-2, every matrix is similar to a polynomial in a companion matrix, and introduces a constructive similarity classification algorithm.
Findings
Over finite fields with |F| ≥ n-2, all matrices are similar to polynomials in companion matrices.
Constructs matrices over finite fields that are not similar to any polynomial in a companion matrix.
Provides a rational algorithm to determine the similarity type of matrices of the form g(C_f).
Abstract
Given a field , an integer , and a matrix , are there polynomials , with monic of degree , such that is similar to , where is the companion matrix of ? For infinite fields the answer is easily seen to positive, so we concentrate on finite fields. In this case we give an affirmative answer, provided . Moreover, for any finite field , with , we construct a matrix that is not similar to any matrix of the form . Of use above, but also of independent interest, is a constructive procedure to determine the similarity type of any given matrix purely in terms of and , without resorting to polynomial roots in or in any extension thereof. This, in turn, yields an algorithm that, given and the invariant factors of any , returns the elementary divisors of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
