AbstractWeakest linear conditions on the rows of a square matrix of arbitrary dimension to ensure that its determinant is positive are described and analyzed. In addition to strict diagonal dominance by rows with positive diagonal elements, we find a new weakest set of conditions: the row mean being positive and larger than all the off-diagonal entries in that row. A complete classification is provided for 3×3 matrices
It is shown that a sufficient condition for a nonnegative real symmetric matrix to be completely pos...
AbstractWe consider the problem of identifying all determinantal inequalities valid on all positive ...
We investigate matrices which have a positive eigenvalue by virtue of their sign--pattern and regard...
AbstractWeakest linear conditions on the rows of a square matrix of arbitrary dimension to ensure th...
AbstractA matrix is totally positive (respectively, strictly totally positive) if all its minors are...
AbstractLet P be the set of all n × n real matrices which have a positive determinant. We show here ...
AbstractWe investigate classes of real square matrices possessing some weakened from of strict diago...
Given a linear system Ax = b, where A is a dominant diagonal matrix with positive diagonals and non-...
Abstract. We establish a sucient condition for strict total positivity of a matrix. In particular, w...
AbstractA sufficient condition for a doubly nonnegative matrix to be completely positive is given, i...
AbstractIn this paper, we investigate lower and upper bounds for determinants. For diagonally domina...
AbstractIt is shown that a sufficient condition for a nonnegative real symmetric matrix to be comple...
We derive a lower bound on determinants, utilizing a theorem of linear programming. Let l and u be p...
AbstractA real matrix is called k-subtotally positive if the determinants of all its submatrices of ...
. Let B+ ae GLn (R) denote the subgroup of upper triangular n \Theta n- matrices with positive entr...
It is shown that a sufficient condition for a nonnegative real symmetric matrix to be completely pos...
AbstractWe consider the problem of identifying all determinantal inequalities valid on all positive ...
We investigate matrices which have a positive eigenvalue by virtue of their sign--pattern and regard...
AbstractWeakest linear conditions on the rows of a square matrix of arbitrary dimension to ensure th...
AbstractA matrix is totally positive (respectively, strictly totally positive) if all its minors are...
AbstractLet P be the set of all n × n real matrices which have a positive determinant. We show here ...
AbstractWe investigate classes of real square matrices possessing some weakened from of strict diago...
Given a linear system Ax = b, where A is a dominant diagonal matrix with positive diagonals and non-...
Abstract. We establish a sucient condition for strict total positivity of a matrix. In particular, w...
AbstractA sufficient condition for a doubly nonnegative matrix to be completely positive is given, i...
AbstractIn this paper, we investigate lower and upper bounds for determinants. For diagonally domina...
AbstractIt is shown that a sufficient condition for a nonnegative real symmetric matrix to be comple...
We derive a lower bound on determinants, utilizing a theorem of linear programming. Let l and u be p...
AbstractA real matrix is called k-subtotally positive if the determinants of all its submatrices of ...
. Let B+ ae GLn (R) denote the subgroup of upper triangular n \Theta n- matrices with positive entr...
It is shown that a sufficient condition for a nonnegative real symmetric matrix to be completely pos...
AbstractWe consider the problem of identifying all determinantal inequalities valid on all positive ...
We investigate matrices which have a positive eigenvalue by virtue of their sign--pattern and regard...
DOI
Add to ORKG