Permutative universal realizability (Q825555)

A list \(\Lambda =\left\{ \lambda _{1},\dots,\lambda _{n}\right\} \) of complex numbers is called realizable if there is an \( n\times n\) matrix \(A\) with nonnegative entries whose spectrum is \(\Lambda \). Well-known theorems show that if \(\Lambda \) is realizable then it contains a real eigenvalue (say \(\lambda _{1}\)) such that \(\lambda _{1}\geq \left\vert \lambda _{i}\right\vert \) for all \(i\). The list \(\Lambda \) is called universally realizable (UR) if additionally \(A\) can be chosen to have each possible Jordan canonical form compatible with spectrum \(\Lambda \) (see [\textit{C. R. Johnson} et al., Oper. Theory: Adv. Appl. 267, 199--220 (2018; Zbl 1427.15001)]). An \(n\times n\) matrix \(A\) is called permutative if each row of \(A\) is a permutation of the first row (see [\textit{X. Hu} et al., Spec. Matrices 4, 233--246 (2016; Zbl 1338.05030)]). The present paper considers the UR problem subject to the further condition that \(A\) must be permutative. For example, if all \(\lambda _{i}\) are real and \(\lambda _{1}>0>\lambda _{2}\geq \lambda _{3}\geq \cdots \geq \lambda _{n}\), then the necessary condition \(\sum_{i}\lambda _{i}\geq 0\) for realizability is also sufficient for \(\Lambda \) to be permutative UR.