Sign patterns that allow diagonalizability

DOI10.1016/S0024-3795(02)00433-0zbMath1025.15026OpenAlexW2098300566MaRDI QIDQ1864965

Yanling Shao, Yu-Bin Gao

Publication date: 23 March 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(02)00433-0

zbMATH Keywords

eigenvaluecyclesign patterndiagonalizability

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Eigenvalues, singular values, and eigenvectors (15A18) Matrices of integers (15B36) Canonical forms, reductions, classification (15A21)

Related Items (7)

Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem ⋮ \(4 \times 4\) irreducible sign pattern matrices that require four distinct eigenvalues ⋮ Is every nonsingular matrix diagonally equivalent to a matrix with all distinct eigenvalues? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Rank conditions for sign patterns that allow diagonalizability ⋮ Sign patterns that allow diagonalizability revisited

Cites Work

• Sign patterns that require repeated eigenvalues
• Matrix Analysis
• Sign patterns that require real, nonreal or pure imaginary eigenvalues
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sign patterns that allow diagonalizability