Sign patterns that allow minimal semipositivity
From MaRDI portal
An \(n \times m\) matrix with real entries \(A\) is semipositive if \(Ax > 0\) (where the inequality is entrywise) for some \(x \geq 0\). \(A\) is minimally semipositive if it is semipositive and no column-deleted submatrix of it is semipositive. The sign patterns of minimally semipositive matrices which have no zero entries are characterized. Of independent interest is a result on complete bipartite subgraphs of bipartite graphs.
Recommendations
Cites work
Cited in
(8)- Which sign patterns are canonical?
- The almost semimonotone matrices
- Zero forcing for sign patterns
- New results about semi-positive matrices.
- Characterizations of minimal semipositivity
- Schur complements of matrices with acyclic bipartite graphs
- scientific article; zbMATH DE number 1457540 (Why is no real title available?)
- The sepr-sets of sign patterns
This page was built for publication: Sign patterns that allow minimal semipositivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894504)