The diagonalizable nonnegative inverse eigenvalue problem

Paper

Abstract

In this paper we prove that the SNIEP

DNIEP, i.e. the symmetric and diagonalizable nonnegative inverse eigenvalue problems are different. We also show that the minimum

for which

is realizable by a diagonalizable matrix is

, and we distinguish diagonalizably realziable lists from general realizable lists using the Jordan Normal Form