SearcharxivSearch

arXiv · 1304.1794

Is every matrix similar to a polynomial in a companion matrix?

Abstract

Given a field $F$, an integer $n\geq 1$, and a matrix $A\in M_n(F)$, are there polynomials $f,g\in F[X]$, with $f$ monic of degree $n$, such that $A$ is similar to $g(C_f)$, where $C_f$ is the companion matrix of $f$? 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 $|F|\geq n-2$. Moreover, for any finite field $F$, with $|F|=m$, we construct a matrix $A\in M_{m+3}(F)$ that is not similar to any matrix of the form $g(C_f)$. Of use above, but also of independent interest, is a constructive procedure to determine the similarity type of any given matrix $g(C_f)$ purely in terms of $f$ and $g$, without resorting to polynomial roots in $F$ or in any extension thereof. This, in turn, yields an algorithm that, given $g$ and the invariant factors of any $A$, returns the elementary divisors of $g(A)$. It is a rational procedure, as opposed to the classical method that uses the Jordan decomposition of $A$ to find that of $g(A)$. Finally, extending prior results by the authors, we show that for an integrally closed ring $R$ with field of fractions $F$ and companion matrices $C,D$ the subalgebra $R< C,D>$ of $M_n(R)$ is a free $R$-module of rank $n+(n-m)(n-1)$, where $m$ is the degree of $\gcd (f,g)\in F[X]$, and a presentation for $R< C,D>$ is given in terms of $C$ and $D$. A counterexample is furnished to show that $R< C,D>$ need not be a free $R$-module if $R$ is not integrally closed. The preceding information is used to study $M_n(R)$, and others, as $R[X]$-modules.

Explore related subjects

Keep this discovery

BibTeXRIS

Natalio H. Guersenzvaig, Fernando Szechtman. 2013-04-05. Is every matrix similar to a polynomial in a companion matrix?. https://arxiv.org/abs/1304.1794

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA