In this article we provide some lists of real numbers which can be realized as the spectra of nonnegative diagonalizable matrices but which are not the spectra of nonnegative symmetric matrices. In particular, we examine the classical list σ = (3 + t, 3 − t, −2, −2, −2) with t ≥ 0, and show that 0 is realizable by a nonnegative diagonalizable matrix only for t ≥ 1. We also provide examples of lists which are realizable as the spectra of nonnegative matrices, but not as the spectra of nonnegative diagonalizable matrices by examining the Jordan Normal Form
AbstractThe nonnegative inverse eigenvalue problem (NIEP) is the problem of determining necessary an...
AbstractIf a set Δ of complex numbers can be partitioned as Δ=Λ1∪⋯∪Λs in such a way that each Λi is ...
Producción CientíficaThe symmetric nonnegative inverse eigenvalue problem (SNIEP) asks for necessary...
In this articlewe provide some lists of real numberswhich can be realized as the spectra of nonnegat...
In this article we provide some lists of real numbers which can be realized as the spectra of nonneg...
AbstractLet A be a nonnegative matrix with spectrum (λ1,λ2,…,λm) and B be a nonnegative matrix with ...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
The nonnegative inverse eigenvalue problem (NIEP) is the problem of finding conditions for the exist...
Given a list of complex numbers σ: = (λ1, λ2,..., λm), we say that σ is realisable if σ is the spect...
AbstractLet σ=(λ1,…,λn) be a list of complex numbers. The nonnegative inverse eigenvalue problem (NI...
AbstractThe nonnegative inverse eigenvalue problem (NIEP) is the problem of determining necessary an...
The real nonnegative inverse eigenvalue problem (RNIEP) asks for necessary and sufficient conditions...
AbstractThe symmetric nonnegative inverse eigenvalue problem (SNIEP) asks when a list σ=(λ1,λ2,…,λn)...
AbstractA result by Brauer shows how to modify one single eigenvalue of a matrix via a rank-one pert...
AbstractThe nonnegative inverse eigenvalue problem (NIEP) is the problem of determining necessary an...
AbstractIf a set Δ of complex numbers can be partitioned as Δ=Λ1∪⋯∪Λs in such a way that each Λi is ...
Producción CientíficaThe symmetric nonnegative inverse eigenvalue problem (SNIEP) asks for necessary...
In this articlewe provide some lists of real numberswhich can be realized as the spectra of nonnegat...
In this article we provide some lists of real numbers which can be realized as the spectra of nonneg...
AbstractLet A be a nonnegative matrix with spectrum (λ1,λ2,…,λm) and B be a nonnegative matrix with ...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
The nonnegative inverse eigenvalue problem (NIEP) is the problem of finding conditions for the exist...
Given a list of complex numbers σ: = (λ1, λ2,..., λm), we say that σ is realisable if σ is the spect...
AbstractLet σ=(λ1,…,λn) be a list of complex numbers. The nonnegative inverse eigenvalue problem (NI...
AbstractThe nonnegative inverse eigenvalue problem (NIEP) is the problem of determining necessary an...
The real nonnegative inverse eigenvalue problem (RNIEP) asks for necessary and sufficient conditions...
AbstractThe symmetric nonnegative inverse eigenvalue problem (SNIEP) asks when a list σ=(λ1,λ2,…,λn)...
AbstractA result by Brauer shows how to modify one single eigenvalue of a matrix via a rank-one pert...
AbstractThe nonnegative inverse eigenvalue problem (NIEP) is the problem of determining necessary an...
AbstractIf a set Δ of complex numbers can be partitioned as Δ=Λ1∪⋯∪Λs in such a way that each Λi is ...
Producción CientíficaThe symmetric nonnegative inverse eigenvalue problem (SNIEP) asks for necessary...