Sign patterns that allow minimal semipositivity (Q1894504): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3943082 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sign patterns of inverse nonnegative matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semipositivity of matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sign patterns of inverse-positive matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4281311 / rank | |||
Normal rank |
Latest revision as of 15:52, 23 May 2024
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
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
sign patterns
0 references
minimally semipositive matrices
0 references
bipartite graphs
0 references