Sign patterns that require repeated eigenvalues
From MaRDI portal
Eigenvalues, singular values, and eigenvectors (15A18) Matrices of integers (15B36) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Canonical forms, reductions, classification (15A21)
Recommendations
- Sign patterns that require real, nonreal or pure imaginary eigenvalues
- Publication:4323739
- 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
Cites work
Cited in
(28)- Sign patterns associated with some graphs that allow or require diagonalizability
- New results on sign patterns that allow diagonalizability
- The graphs of the unambiguous entries in the product of two \((+,-)\) sign pattern matrices
- Rank conditions for sign patterns that allow diagonalizability
- Nested sequences of principal minors and potential stability
- Allow problems concerning spectral properties of sign pattern matrices: a survey
- Sign patterns that allow diagonalizability revisited
- scientific article; zbMATH DE number 724779 (Why is no real title available?)
- scientific article; zbMATH DE number 5174835 (Why is no real title available?)
- Eigenvalue distribution of certain ray patterns
- From real to complex sign pattern matrices
- Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
- Nonzero matrix patterns that require distinct eigenvalues
- Two classes of symmetric sign patterns that require unique inertia.
- The allow sequence of distinct eigenvalues for a sign pattern
- Partly zero eigenvectors and matrices that satisfyAu=b
- Sign patterns that require real, nonreal or pure imaginary eigenvalues
- \(4 \times 4\) irreducible sign pattern matrices that require four distinct eigenvalues
- scientific article; zbMATH DE number 1895187 (Why is no real title available?)
- Tree sign pattern matrices that require zero eigenvalues
- Combinatorial considerations for the number of distinct eigenvalues of a matrix
- Sign patterns that allow diagonalizability
- Sign Patterns That Allow a Positive or Nonnegative Left Inverse
- Square nearly nonpositive sign pattern matrices
- Sign-patterns which require a positive eigenvalue
- Minimum number of distinct eigenvalues allowed by a sign pattern
- Some sign patterns that allow a real inverse pair \(B\) and \(B^{-1}\)
- How many negative entries can \(A^ 2\) have?
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)
