Refined inertia sets for structured sign patterns
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29) Sign pattern matrices (15B35) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)
The authors study the possible refined inertias of a specific class of \(2n \times 2n\) structured sign patterns \N\[\N\mathcal{C}=\mathcal{C}(\mathcal{A}, \mathcal{D})= \left[\begin{array}{c|c} \mathcal{A} & \mathcal{D} \\\N\hline I & O \end{array} \right],\N\]\Nwhere \(\mathcal{D}\) is the positive diagonal sign pattern and \(\mathcal{A}\) is the irreducible sign pattern of order \(n\) of the type \N\[\N\mathcal{V}_n = \begin{bmatrix} + & + & \cdots & \cdots & + \\\N- & 0 \\\N& \ddots & \ddots \\\N&& \ddots & 0 \\\N&&& -& - \end{bmatrix} \quad \mbox{or}\quad \mathcal{T}_n = \begin{bmatrix} + & + \\\N- & 0 & + \\\N& - & \ddots & \ddots \\\N&& \ddots & 0 & + \\\N&&& -& - \end{bmatrix} .\N\]\N\NThe authors establish necessary structural conditions for the directed graph of \(\mathcal{A}\) to allow the maximum number of refined inertias (denoted as requiring \(\mathcal{RI}_n\)). These conditions vary based on the parity of \(n\). On the other hand, the paper identifies a specific symmetry in the Jacobian matrix associated with the characteristic polynomial of \(C(A, dI)\). This symmetry allows the determinant of the \(2n \times 2n\) Jacobian to be factorized into the product of two \(n \times n\) determinants, significantly simplifying the verification of the ``nonzero Jacobian condition.\N\NThe tridiagonal sign pattern \(\mathcal{T}_n\) was recently considered by \textit{K. Castillo} et al. [Appl. Math. Comput. 467, Article ID 128497, 8 p. (2024; Zbl 1545.15008)] using Chebyshev polynomials of the second kind.
- A proof of the T_n conjecture: Centralizers, Jacobians and spectrally arbitrary sign patterns
- An inverse eigenvalue problem for structured matrices determined by graph pairs
- Construction of matrices with a given graph and prescribed interlaced spectral data
- Critical sets of inertias for matrix patterns
- Inertias of matrices and sign patterns related to a system of second order ODEs
- Minimal Spectrally Arbitrary Sign Patterns
- Skew-adjacency matrices of graphs
- Spectrally and inertially arbitrary sign patterns
- Spectrally arbitrary patterns
- Techniques for identifying inertially arbitrary patterns
- The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
- The non-symmetric strong multiplicity property for sign patterns
This page was built for publication: Refined inertia sets for structured sign patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839473)
