About the persymmetric nonnegative inverse eigenvalue problem in low dimension (Q6489367)

A list \(\lambda = \{\lambda_1, \dots , \lambda_n\}\) of complex numbers is said to be realizable if there exists an \(n \times n\) nonnegative matrix \(A\) whose spectrum is \(\Lambda\) (counting multiplicities) and \(A\) is called a realizing matrix for \(\Lambda\). The problem of characterizing all realizable lists \(\Lambda\) is known as the Nonnegative Inverse Eigenvalue Problem (NIEP), a well-known problem in matrix theory. An \(n\times n\) matrix \(P\) is said to be persymmetric if it is symmetric about its anti-diagonal, i.e., \(p_{ij} = p_{n-j+1, n-i+1}\), \(i, j=1, \dots, n\), i.e., \(P\) equals to its flip-transpose. Moreover, when the realizing matrix \(A\) is required to be persymmetric in NIEP, it is called the Persymmetric Nonnegative Inverse Eigenvalue Problem (PNIEP).NEWLINENEWLINEIn this paper, the authors show that the NIEP and the PNIEP are equivalent for any realizable list when \(n=3\). Additionally, they present a new sufficient condition for a list of three complex numbers to constitute the spectrum of a persymmetric nonnegative matrix with prescribed diagonal entries. For some realizable lists when \(n=4\), they show that the NIEP and the PNIEP are equivalent, but these two problems generally differ. They also provide a sufficient condition for a trace zero list regarding PNIEP. Finally the paper concludes with posing a question regarding PNIEP when \(n=5\).