Nonzero matrix patterns that require distinct eigenvalues

DOI10.1016/J.LAA.2026.04.011MaRDI QIDQ7238496zbMATH OpenFDO

Authors M. Cavers, Kevin N. Vander Meulen

Publication date 7 May 2026

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

Full work available at URL https://doi.org/10.1016/J.LAA.2026.04.011

zbMATH Keywords

digraphdistinct eigenvalueseigenvalueinverse eigenvalue problemnonzero pattern

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Sign pattern matrices (15B35)

Cites work

• \(4 \times 4\) irreducible sign pattern matrices that require four distinct eigenvalues
• Combinatorial considerations for the number of distinct eigenvalues of a matrix
• scientific article; zbMATH DE number 724779 (Why is no real title available?)
• scientific article; zbMATH DE number 1895187 (Why is no real title available?)
• Inertias of zero–nonzero patterns
• Sign patterns requiring a unique inertia
• Sign patterns that require exactly one real eigenvalue and patterns that requiren−1 nonreal eigenvalues
• Sign patterns that require real, nonreal or pure imaginary eigenvalues
• Sign patterns that require repeated eigenvalues
• Sign-patterns which require a positive eigenvalue
• Skew-adjacency matrices of graphs
• Sparse inertially arbitrary patterns
• Spectrally arbitrary zero–nonzero patterns of order 4
• The allow sequence of distinct eigenvalues for a sign pattern
• Tree sign pattern matrices that require zero eigenvalues

This page was built for publication: Nonzero matrix patterns that require distinct eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238496)