The nonnegative inverse eigenvalue problem from the coefficients of the characteristic polynomial. EBL digraphs Original Research Article

The nonnegative inverse eigenvalue problem (NIEP) is: given a family of complex numbers σ={λ1,…,λn}, find necessary and sufficient conditions for the existence of a nonnegative matrix A of order n with spectrum σ. Loewy and London [R. Loewy, D. London, A note on the inverse eigenvalue problems for nonnegative matrices, Linear and Multilinear Algebra 6 (1978) 83–90] resolved it for n=3, and for n=4 when the spectrum is real. In our way of handling the NIEP, we focus our attention on the coefficients of the characteristic polynomial of A. Thus, the NIEP that we consider is: “given k1,k2,…,kn real numbers, find necessary and sufficient conditions for the existence of a nonnegative matrix A of order n with characteristic polynomial xn+k1xn-1+k2xn-2+cdots, three dots, centered+kn”. The coefficients of the characteristic polynomial are closely related to the cyclic structure of the weighted digraph with adjacency matrix A. We introduce a special type of digraph structure, that we shall call EBL, in which this relation is specially simple. We give some results that show the interest of EBL structures. We completely solve the NIEP from the coefficients of the characteristic polynomial for n=4. We also solve a special case of the NIEP for nless-than-or-equals, slant2p+1 with k1=cdots, three dots, centered=kp-1=0 and pgreater-or-equal, slanted2.