We first give a complete list of polynomial conditions on the data for TP (TN) completability of partial TP (TN) matrices with just one or two unspecified entries in either or both of the upper right or lower left entries. These results are used to identify which such patterns, and related patterns, are TP (TN) completable. Then, the TN completable echelon and TP completable jagged patterns are characterized. This generalizes earlier work on combinatorially symmetric TN completable patterns. (C) 2012 Elsevier Inc. All rights reserved
For any pattern of the specified entries, an explicit finite list of polynomial inequalities in the ...
An n-by-n real matrix is called a P-matrix if all its principal minors are positive. The P-matrix co...
A pattern is a list of positions in an n×n real matrix. A matrix completion problem for the class of...
We first give a complete list of polynomial conditions on the data for TP (TN) completability of par...
A matrix is called totally nonnegative (TN) if the determinant of every square submatrix is nonnegat...
Every partial TP2 (TP1) matrix with one unspecified entry has a TP2 (TP1) completion. For a given m-...
A matrix is called totally nonnegative (TN) if the determinant of every square submatrix is nonnegat...
Though some special cases are now understood, the characterization of TP-completable patterns is far...
We present two complementary techniques called catalysis and inhibition which allow one to determine...
Abstract. Every partial TP2 (TP1) matrix with one unspecified entry has a TP2 (TP1) com-pletion. For...
The notions of total positivity and of TPk are generalized to shapes (a generalization of matrices...
A matrix is called TP2 if all 1-by-1 and 2-by-2 minors are positive. A partial matrix is one with so...
In earlier work, the labelled graphs G for which every combinatorially symmetric totally nonnegative...
In this paper the P0-matrix completion problem is considered. It is established that every asymmetri...
AbstractThe notions of total positivity and of TPk are generalized to “shapes” (a generalization of ...
For any pattern of the specified entries, an explicit finite list of polynomial inequalities in the ...
An n-by-n real matrix is called a P-matrix if all its principal minors are positive. The P-matrix co...
A pattern is a list of positions in an n×n real matrix. A matrix completion problem for the class of...
We first give a complete list of polynomial conditions on the data for TP (TN) completability of par...
A matrix is called totally nonnegative (TN) if the determinant of every square submatrix is nonnegat...
Every partial TP2 (TP1) matrix with one unspecified entry has a TP2 (TP1) completion. For a given m-...
A matrix is called totally nonnegative (TN) if the determinant of every square submatrix is nonnegat...
Though some special cases are now understood, the characterization of TP-completable patterns is far...
We present two complementary techniques called catalysis and inhibition which allow one to determine...
Abstract. Every partial TP2 (TP1) matrix with one unspecified entry has a TP2 (TP1) com-pletion. For...
The notions of total positivity and of TPk are generalized to shapes (a generalization of matrices...
A matrix is called TP2 if all 1-by-1 and 2-by-2 minors are positive. A partial matrix is one with so...
In earlier work, the labelled graphs G for which every combinatorially symmetric totally nonnegative...
In this paper the P0-matrix completion problem is considered. It is established that every asymmetri...
AbstractThe notions of total positivity and of TPk are generalized to “shapes” (a generalization of ...
For any pattern of the specified entries, an explicit finite list of polynomial inequalities in the ...
An n-by-n real matrix is called a P-matrix if all its principal minors are positive. The P-matrix co...
A pattern is a list of positions in an n×n real matrix. A matrix completion problem for the class of...