Rational solutions of certain matrix equations
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Quadratic and bilinear Diophantine equations (11D09) Lattice points in specified regions (11P21) Vector spaces, linear dependence, rank, lineability (15A03) Linear transformations, semilinear transformations (15A04) Matrix equations and identities (15A24) Matrices of integers (15B36)
A sign pattern is a matrix whose elements are \(+\), \(-\) or \(0\). For a real matrix \(B\), sgn\((B)\) is the sign pattern obtained by replacing each positive, negative or zero element of \(B\) by \(+\), \(-\) or \(0\). For a given sign pattern \(A\), the sign pattern class of \(A\), denoted by \(Q(A)\), is the set \(\{B:\text{sgn}(B)=A\}\). The following theorem is proved: given a real matrix equation \(AB=C\) in which the zero bipartite graph of \(C\) is a forest, then there exist rational perturbations maintaining the same sign pattern classes of the original matrices, such that \(\widetilde A\widetilde B=\widetilde C\).
- On the solution of a rational matrix equation arising in G-networks
- Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations
- Rational solutions of certain equations involving norms
- Rational realization of the minimum ranks of nonnegative sign pattern matrices.
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks
- Essential sign change numbers of full sign pattern matrices
- Partly zero eigenvectors and matrices that satisfyAu=b
- ZPC matrices and zero cycles
- Exact rational solution of the matrix equation \(A=p(X)\) by linearization
This page was built for publication: Rational solutions of certain matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959869)