Perron similarities and the nonnegative inverse eigenvalue problem

The longstanding <italic>nonnegative inverse eigenvalue problem</italic> (NIEP) is to determine which multisets of complex numbers occur as the spectrum of an entry-wise nonnegative matrix. Although there are some well-known necessary conditions, a solution to the NIEP is far from known. An invertible matrix is called a <italic>Perron similarity</italic> if it diagonalizes an irreducible, nonnegative matrix. Johnson and Paparella [Linear Algebra Appl. <bold>493</bold> (2016), pp. 281–300] developed the theory of real Perron similarities. Here, we fully develop the theory of complex Perron similarities. Each Perron similarity gives a nontrivial polyhedral cone and convex polytope of realizable spectra (thought of as vectors in complex Euclidean space). The extremals of these convex sets are finite in number, and their determination for each Perron similarity would solve the diagonalizable NIEP, a major portion of the entire problem. By considering Perron similarities of certain realizing matrices of Type I Karpelevič arcs, large portions of realizable spectra are generated for a given positive integer. This is demonstrated by producing a nearly complete geometrical representation of the spectra of four-by-four stochastic matrices. Similar to the Karpelevič region, it is shown that the subset of complex Euclidean space comprising the spectra of stochastic matrices is compact and star-shaped. <italic>Extremal</italic> elements of the set are defined and shown to be on the boundary. It is shown that the polyhedral cone and convex polytope of the <italic>discrete Fourier transform (DFT) matrix</italic> corresponds to the conical hull and convex hull of its rows, respectively. Similar results are established for multifold Kronecker products of DFT matrices and multifold Kronecker products of DFT matrices and Walsh matrices. These polytopes are of great significance with respect to the NIEP because they are <italic>extremal</italic> in the region comprising the spectra of stochastic matrices. Implications for further inquiry are also given.

Authors

Institutions

Publication Details

Journal
Transactions of the American Mathematical Society
Published
2025-10-02
DOI
https://doi.org/10.1090/tran/9596
Citations
1
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
1.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Perron similarities and the nonnegative inverse eigenvalue problem

Pietro Paparella, Charles R. Johnson
1 citations
Transactions of the American Mathematical Society
Matrix Theory and Algorithms
1.50
article

Perron similarities and the nonnegative inverse eigenvalue problem

Pietro Paparella, Charles R. Johnson
article en
1 citations

Abstract

The longstanding <italic>nonnegative inverse eigenvalue problem</italic> (NIEP) is to determine which multisets of complex numbers occur as the spectrum of an entry-wise nonnegative matrix. Although there are some well-known necessary conditions, a solution to the NIEP is far from known. An invertible matrix is called a <italic>Perron similarity</italic> if it diagonalizes an irreducible, nonnegative matrix. Johnson and Paparella [Linear Algebra Appl. <bold>493</bold> (2016), pp. 281–300] developed the theory of real Perron similarities. Here, we fully develop the theory of complex Perron similarities. Each Perron similarity gives a nontrivial polyhedral cone and convex polytope of realizable spectra (thought of as vectors in complex Euclidean space). The extremals of these convex sets are finite in number, and their determination for each Perron similarity would solve the diagonalizable NIEP, a major portion of the entire problem. By considering Perron similarities of certain realizing matrices of Type I Karpelevič arcs, large portions of realizable spectra are generated for a given positive integer. This is demonstrated by producing a nearly complete geometrical representation of the spectra of four-by-four stochastic matrices. Similar to the Karpelevič region, it is shown that the subset of complex Euclidean space comprising the spectra of stochastic matrices is compact and star-shaped. <italic>Extremal</italic> elements of the set are defined and shown to be on the boundary. It is shown that the polyhedral cone and convex polytope of the <italic>discrete Fourier transform (DFT) matrix</italic> corresponds to the conical hull and convex hull of its rows, respectively. Similar results are established for multifold Kronecker products of DFT matrices and multifold Kronecker products of DFT matrices and Walsh matrices. These polytopes are of great significance with respect to the NIEP because they are <italic>extremal</italic> in the region comprising the spectra of stochastic matrices. Implications for further inquiry are also given.

Transactions of the American Mathematical SocietyVol. 378(12)
University of Washington Bothell (US), Virginia Research Institute (US)
Openalex Percentile: Top 13%
Matrix Theory and Algorithms
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.