Fillmore's theorem for integer matrices

DOI10.1016/J.LAA.2017.06.011MaRDI QIDQ2402453zbMATH OpenOpenAlexFDO

Authors Alberto Borobia

Publication date 7 September 2017

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1704.08037

zbMATH Keywords

arbitrary fielddiagonalFillmore theoreminteger matrixinverse problemsimilarity

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Inverse problems in linear algebra (15A29) Matrix completion problems (15A83) Matrices of integers (15B36)

Abstract: Fillmore Theorem says that if $A$ is a nonscalar matrix of order $n$ over a field $mathbbF$ and $gamm{a}_1,ldots,gamm{a}_{n}inmathbbF$ are such that $gamm{a}_1+cdots+gamm{a}_n=exttr,A$, then there is a matrix $B$ similar to $A$ with diagonal $(gamm{a}_1,ldots,gamm{a}_n)$. Fillmore proof works by induction on the size of $A$ and implicitly provides an algorithm to construct $B$. We develop an explicit and extremely simple algorithm that finish in two steps (two similarities), and with its help we extend Fillmore Theorem to integers (if $A$ is integer then we can require to $B$ to be integer).

Recommendations

• A new proof of Fillmore's theorem for integer matrices
• Generalization of Mirsky's theorem on diagonals and eigenvalues of matrices
• Fillmore's theorem for matrices over factorial rings
• Short proofs of theorems of Mirsky and Horn on diagonals and eigenvalues of matrices
• Integral similarity and commutators of integral matrices

Cites work

• Matrix theory
• On Similarity and the Diagonal of a Matrix

Cited in

(7)

• On nonnegative matrices with prescribed eigenvalues and diagonal entries
• Fillmore's theorem for matrices over factorial rings
• Brauer's theorem and nonnegative matrices with prescribed diagonal entries
• A new proof of Fillmore's theorem for integer matrices
• Sum of two strictly n -zero matrices
• On Fillmore's theorem over integrally closed domains
• A fillmore theorem-based approach to reduce zero sensitivity in discrete-time LTI controllers with infinite lifespan in homomorphic encrypted control systems

This page was built for publication: Fillmore's theorem for integer matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402453)