AbstractLinear systems, Ax=b, for which the sign patterns A and b completely determine the set of sign patterns of vectors in the solution set are studied. These systems generalize the existing notion of sign-solvable linear systems. Linear systems with signed solutions are characterized in terms of two classes of matrices. The first class, L-matrices, plays a central role in the study of sign-solvable linear systems. The second class is new and generalizes the class of S∗-matrices that arise in sign-solvable linear systems. Several constructions for the new class of matrices are given
AbstractA sequence (A1,…,An) of nonempty subsets of Rm is an S-system if for each choice of a1∈A1,…,...
Sign-solvable linear systems are part of a branch of mathematics called qualitative matrix theory. Q...
AbstractA characterization of sign solvable graphs is presented together with a polynomial algorithm...
AbstractLinear systems, Ax=b, for which the sign patterns A and b completely determine the set of si...
AbstractA linear system of equations Ax=b is sign solvable if it is solvable and both its solvabilit...
AbstractQualitative properties of general collections of systems of m linear equations in n unknowns...
AbstractA linear system of equations Ax=b is sign solvable if it is solvable and both its solvabilit...
AbstractA class of signed digraphs which arises naturally, in the theory of sign solvable linear sys...
AbstractFor a real matrix A, Q(A) denotes the set of all matrices with the same sign pattern as A. A...
AbstractA linear system of equations Ax=b is called sign inconsistent if for each matrix (A′,b′) wit...
AbstractThe structure of sign-solvable and strongly sign-solvable systems is studied here by a refin...
AbstractQualitative properties of general collections of systems of m linear equations in n unknowns...
AbstractA class of signed digraphs which arises naturally, in the theory of sign solvable linear sys...
AbstractFor a real matrix A, Q(A) denotes the set of all matrices with the same sign pattern as A. A...
Sign-solvable linear systems are part of a branch of mathematics called qualitative matrix theory. Q...
AbstractA sequence (A1,…,An) of nonempty subsets of Rm is an S-system if for each choice of a1∈A1,…,...
Sign-solvable linear systems are part of a branch of mathematics called qualitative matrix theory. Q...
AbstractA characterization of sign solvable graphs is presented together with a polynomial algorithm...
AbstractLinear systems, Ax=b, for which the sign patterns A and b completely determine the set of si...
AbstractA linear system of equations Ax=b is sign solvable if it is solvable and both its solvabilit...
AbstractQualitative properties of general collections of systems of m linear equations in n unknowns...
AbstractA linear system of equations Ax=b is sign solvable if it is solvable and both its solvabilit...
AbstractA class of signed digraphs which arises naturally, in the theory of sign solvable linear sys...
AbstractFor a real matrix A, Q(A) denotes the set of all matrices with the same sign pattern as A. A...
AbstractA linear system of equations Ax=b is called sign inconsistent if for each matrix (A′,b′) wit...
AbstractThe structure of sign-solvable and strongly sign-solvable systems is studied here by a refin...
AbstractQualitative properties of general collections of systems of m linear equations in n unknowns...
AbstractA class of signed digraphs which arises naturally, in the theory of sign solvable linear sys...
AbstractFor a real matrix A, Q(A) denotes the set of all matrices with the same sign pattern as A. A...
Sign-solvable linear systems are part of a branch of mathematics called qualitative matrix theory. Q...
AbstractA sequence (A1,…,An) of nonempty subsets of Rm is an S-system if for each choice of a1∈A1,…,...
Sign-solvable linear systems are part of a branch of mathematics called qualitative matrix theory. Q...
AbstractA characterization of sign solvable graphs is presented together with a polynomial algorithm...