scientific article; zbMATH DE number 3781471

MaRDI QIDQ3961028zbMATH OpenFDO

Authors D. A. Gregory, Norman J. Pullman, D. de Caen

Publication date 1981

zbMATH Keywords

Schein rankSperner's lemmaBoolean matrixBoolean rank

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Canonical forms, reductions, classification (15A21) Semigroups of transformations, relations, partitions, etc. (20M20) Vector spaces, linear dependence, rank, lineability (15A03)

Cited in

(27)

• Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
• Isolation numbers of integer matrices and their preservers
• Linear operators that preserve graphical properties of matrices: Isolation numbers
• Boolean rank of upset tournament matrices
• Isolation number versus Boolean rank
• Factorization properties of \((n {\times} n)\) Boolean matrices
• Real rank versus nonnegative rank
• Heuristics for exact nonnegative matrix factorization
• A set coverage problem
• Boolean rank of Kronecker products
• On the linear extension complexity of regular \(n\)-gons
• On the geometric interpretation of the nonnegative rank
• More on deterministic and nondeterministic finite cover automata
• The rectangle covering number of random Boolean matrices
• Upper bounds on the Boolean rank of Kronecker products
• Covering graphs by the minimum number of equivalence relations
• Matrix Invariants over Semirings
• Boolean-rank-preserving operators and Boolean-rank-1 spaces
• On minimally non-firm binary matrices
• Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
• Minimum matrix rank of k-regular (0,1) matrices
• Problems and invariants connected with bicliques and multicliques of graphs
• On the binary and Boolean rank of regular matrices
• On \(\epsilon\)-sensitive monotone computations
• The Boolean rank of the uniform intersection matrix and a family of its submatrices
• Strict group testing and the set basis problem
• Modeling combinatorial disjunctive constraints via junction trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3961028)