Sign patterns that allow minimal semipositivity (Q1894504)

From MaRDI portal
Revision as of 15:52, 23 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sign patterns that allow minimal semipositivity
scientific article

    Statements

    Sign patterns that allow minimal semipositivity (English)
    0 references
    0 references
    0 references
    0 references
    25 January 1996
    0 references
    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.
    0 references
    0 references
    sign patterns
    0 references
    minimally semipositive matrices
    0 references
    bipartite graphs
    0 references