On characterizing \(N\)-matrices using linear complementarity (Q1183141)

A square matrix \(A\) of order \(n\) is called an \(N\)-matrix if all its principal minors are negative. \(N\)-matrices arise in the theory of global univalence of functions, in multivariate analysis, and in linear complementarity problems. Given a square matrix \(A\) of order \(n\), and a vector \(q\in R^ n\), the linear complementarity problem is to find vectors \(w\), \(z\in R^ n\) such that (1) \(w-Az=q\), (2) \(w\geq 0\), \(z\geq 0\), (3) \(w^ tz=0\). This problem is denoted by \((q,A)\). A pair \((W,z)\) of vectors satisfying (1) to (3) is called a solution to \((q,A)\). The authors show that a square matrix \(A\) with at least one positive entry and all principal minors negative can be characterized in terms of the number of solutions the linear complementarity problem \((q,A)\) with the matrix \(A\) has for different vectors \(q\). Such a matrix can also be characterized in terms of a sign nonreversal property. These results complement the known results for a square matrix \(A<0\) with all its principal minors negative. The paper contains sections of sign pattern of \(N\)-Matrices and some characterization theorems for \(N\)-Matrices.