Sign patterns that allow diagonalizability
From MaRDI portal
Recommendations
- Sign patterns that allow diagonalizability revisited
- New results on sign patterns that allow diagonalizability
- Sign patterns associated with some graphs that allow or require diagonalizability
- Rank conditions for sign patterns that allow diagonalizability
- scientific article; zbMATH DE number 2095759
- Inertially arbitrary (2r-1)-diagonal sign patterns
- scientific article; zbMATH DE number 26303
- Sign patterns occurring in orthogonal matrices
- scientific article; zbMATH DE number 1175876
- Sign-nonsingular matrices and orthogonal sign-patterns
Cites work
- scientific article; zbMATH DE number 724779 (Why is no real title available?)
- scientific article; zbMATH DE number 825098 (Why is no real title available?)
- Combinatorial matrix theory
- Matrix Analysis
- Sign patterns that require real, nonreal or pure imaginary eigenvalues
- Sign patterns that require repeated eigenvalues
Cited in
(7)- Sign patterns associated with some graphs that allow or require diagonalizability
- New results on sign patterns that allow diagonalizability
- Rank conditions for sign patterns that allow diagonalizability
- Is every nonsingular matrix diagonally equivalent to a matrix with all distinct eigenvalues?
- Sign patterns that allow diagonalizability revisited
- 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
This page was built for publication: Sign patterns that allow diagonalizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864965)
