Sign patterns that require repeated eigenvalues
From MaRDI portal
Publication:686376
DOI10.1016/0024-3795(93)90225-DzbMath0795.15008MaRDI QIDQ686376
Carolyn A. Eschenbach, Charles R. Johnson
Publication date: 13 October 1993
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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) Matrices of integers (15B36) Canonical forms, reductions, classification (15A21)
Related Items (18)
Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns ⋮ The graphs of the unambiguous entries in the product of two \((+,-)\) 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 ⋮ Tree sign pattern matrices that require zero eigenvalues ⋮ Some sign patterns that allow a real inverse pair \(B\) and \(B^{-1}\) ⋮ How many negative entries can \(A^ 2\) have? ⋮ Unnamed Item ⋮ Square nearly nonpositive sign pattern matrices ⋮ From real to complex sign pattern matrices ⋮ Unnamed Item ⋮ Eigenvalue distribution of certain ray patterns ⋮ Rank conditions for sign patterns that allow diagonalizability ⋮ Allow problems concerning spectral properties of sign pattern matrices: a survey ⋮ Unnamed Item ⋮ Minimum number of distinct eigenvalues allowed by a sign pattern ⋮ Sign patterns that allow diagonalizability revisited ⋮ Sign patterns that allow diagonalizability
Cites Work
This page was built for publication: Sign patterns that require repeated eigenvalues
