Diagonal realizability in the Nonnegative Inverse Eigenvalue Problem
Thomas J. Laffey, Helena \v{S}migoc

TL;DR
This paper proves that any nonzero spectrum of a diagonalizable nonnegative matrix can be realized by a larger diagonalizable nonnegative matrix of a specific size, advancing understanding of the Nonnegative Inverse Eigenvalue Problem.
Contribution
It establishes a new construction method showing that nonzero spectra can be realized by larger matrices with a specific size, contributing to the diagonal realizability aspect of the NIEP.
Findings
Any nonzero spectrum of a diagonalizable nonnegative matrix can be realized by a larger diagonalizable nonnegative matrix.
The size of the constructed matrix is explicitly given as $k + k^2$ for a spectrum of size $k$.
This result provides a new approach to the diagonal realizability in the Nonnegative Inverse Eigenvalue Problem.
Abstract
We show that if a list of nonzero complex numbers is the nonzero spectrum of a diagonalizable nonnegative matrix, then is the nonzero spectrum of a diagonalizable nonnegative matrix of order
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.
Taxonomy
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Graph theory and applications
