Sign patterns that allow minimal semipositivity
type: Item
instance of: scholarly article
title: Sign patterns that allow minimal semipositivity
zbMATH Open document ID: 0829.15017
DOI: 10.1016/0024-3795(94)00181-C
author: Charles R. Johnson
author: William McCuaig
author: David P. Stanford
published in: Linear Algebra and its Applications
publication date: 1996-01-25T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 15B48
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 778265
zbMATH Keywords: sign patterns
zbMATH Keywords: minimally semipositive matrices
zbMATH Keywords: bipartite graphs
reviewed by: Giacomo Bonanno
MaRDI profile type: Publication
cites work: Q3943082
cites work: Sign patterns of inverse nonnegative matrices
cites work: Semipositivity of matrices
cites work: Sign patterns of inverse-positive matrices
cites work: Q4281311
description: scientific article; zbMATH DE number 778265