Sign patterns that require repeated eigenvalues
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Canonical forms, reductions, classification (15A21) Matrices of integers (15B36)
An sign-pattern matrix is an \(n\)-by-\(n\) matrix \(B\) whose entries are elements of the set \(\{+,-,0\}\). The sign-pattern class \(Q(B)\) associated with \(B\) is the set of all \(n\)-by-\(n\) real matrices\(A\) for which the entry of \(A\) in the intersection of row \(i\) and column \(j\) is positive (respectively, negative, zero) if the entry of \(B\) in the same location is + (respectively, \(-\), 0). For every positive integer \(k\), the authors characterize all matrices \(B\) for which \(k\) is the smallest integer with the property that every matrix \(A\) in \(Q(B)\) has an eigenvalue of multiplicity at least \(k\). The characterization is given in terms of the size of zero submatrices of \(B\), or in terms of the length of cycles in the directed graph on vertices \(\{1,\dots,n\}\) associated with \(B\) in the usual way. The graph contains an arrow starting at \(i\) and ending at \(j\) if and only if the element of \(B\) in the intersection of row \(i\) and column \(j\) is not 0. The authors discuss the relationship of the above characterization to diagonalizability (by similarity) of matrices in \(Q(B)\) and give several instructive examples.
- Sign patterns that require real, nonreal or pure imaginary eigenvalues
- scientific article; zbMATH DE number 724779
- Sign-patterns which require a positive eigenvalue
- Sign patterns that require exactly one real eigenvalue and patterns that requiren−1 nonreal eigenvalues
- Sign patterns for eigenmatrices of nonnegative matrices
- Allow problems concerning spectral properties of sign pattern matrices: a survey
- The graphs of the unambiguous entries in the product of two \((+,-)\) sign pattern matrices
- Nested sequences of principal minors and potential stability
- Two classes of symmetric sign patterns that require unique inertia.
- Sign patterns that allow diagonalizability
- Minimum number of distinct eigenvalues allowed by a sign pattern
- Rank conditions for sign patterns that allow diagonalizability
- Sign patterns that allow diagonalizability revisited
- Sign-patterns which require a positive eigenvalue
- Eigenvalue distribution of certain ray patterns
- Sign patterns that require real, nonreal or pure imaginary eigenvalues
- Partly zero eigenvectors and matrices that satisfyAu=b
- scientific article; zbMATH DE number 724779 (Why is no real title available?)
- Tree sign pattern matrices that require zero eigenvalues
- From real to complex sign pattern matrices
- scientific article; zbMATH DE number 1895187 (Why is no real title available?)
- Sign patterns associated with some graphs that allow or require diagonalizability
- New results on sign patterns that allow diagonalizability
- scientific article; zbMATH DE number 5174835 (Why is no real title available?)
- Sign Patterns That Allow a Positive or Nonnegative Left Inverse
- Square nearly nonpositive sign pattern matrices
- \(4 \times 4\) irreducible sign pattern matrices that require four distinct eigenvalues
- The allow sequence of distinct eigenvalues for a sign pattern
- Some sign patterns that allow a real inverse pair \(B\) and \(B^{-1}\)
- How many negative entries can A^ 2 have?
- Combinatorial considerations for the number of distinct eigenvalues of a matrix
- Nonzero matrix patterns that require distinct eigenvalues
- Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
This page was built for publication: Sign patterns that require repeated eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686376)
