2017/08/24 by Cristina Manzaneda, Enide Andrade, Manzaneda, Cristina B. +3
Computer Science · Engineering · Mathematics · #Advanced Topics in Algebra #Combinatorics (math.CO) #FOS: Mathematics #Matrix Theory and Algorithms #Spectral Theory (math.SP) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1708.07397
openalex publication_date 2017/08/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A square matrix of order n with n≥ 2 is called permutative matrix when all its rows (up to the frst one) are permutations of precisely its frst row. In this paper recalling spectral results for partitioned into 2-by-2 symmetric blocks matrices sufcient conditions on a given complex list to be the list of the eigenvalues of a nonnegative permutative matrix are given. In particular, we study NIEP and PNIEP when some complex elements into the considered lists have no zero imaginary part. Realizability regions for nonnegative permutative matrices are obtained.