Sign patterns that allow diagonalizability revisited
From MaRDI portal
Publication:2851011
DOI10.1080/03081087.2012.746329zbMath1272.05112OpenAlexW2016977114MaRDI QIDQ2851011
Xin-Lei Feng, Zhongshan Li, Jun Luo, Ting-Zhu Huang, Yu-Bin Gao
Publication date: 1 October 2013
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2012.746329
distinct eigenvaluessign patternminimum rankmaximum rankgeneralized permutationallow diagonalizabilityallow normalitymaximum cycle length
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Sign pattern matrices (15B35)
Related Items
Cites Work
- Every invertible matrix is diagonally equivalent to a matrix with distinct eigenvalues
- Is every nonsingular matrix diagonally equivalent to a matrix with all distinct eigenvalues?
- Sign patterns of nonnegative normal matrices
- Sign patterns that require repeated eigenvalues
- Sign patterns that allow diagonalizability
- The moment and Gram matrices, distinct eigenvalues and zeroes, and rational criteria for diagonalizability
- Combinatorial Matrix Theory