Ranks of zero patterns and sign patterns*

DOI10.1080/03081089308818204zbMath0793.05027OpenAlexW1994927309MaRDI QIDQ4291675

Daniel Hershkowitz, Hans Schneider

Publication date: 10 May 1994

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.7870

zbMATH Keywords

matricesranksign patternsheight characteristic

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Rank functions of tropical matrices, Predecessor property, full combinatorial column rank, and the height characteristic of an \(M\)-matrix, Essential sign change numbers of full sign pattern matrices, Paths in directed graphs and spectral properties of matrices, On unicyclic graphs with uniquely restricted maximum matchings, Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs, Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns, On the existence of sequences and matrices with prescribed partial sums of elements, Ray patterns of matrices and nonsingularity, Conditions for duality between fluxes and concentrations in biochemical networks, Security index based on perfectly undetectable attacks: graph-theoretic conditions, Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings, Unnamed Item, Zero forcing number, constrained matchings and strong structural controllability, Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids, Sign patterns that require almost unique rank, Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms, Generalized subgraph-restricted matchings in graphs, Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations, The minimum size of unextendible product bases in the bipartite case (and some multipartite cases), Qualitative controllability and uncontrollability by a single entry, Rational realization of the minimum ranks of nonnegative sign pattern matrices, On the Maximum Uniquely Restricted Matching for Bipartite Graphs, Orthogonal representations over finite fields and the chromatic number of graphs, Rational realizations of the minimum rank of a sign pattern matrix, Sign patterns with minimum rank 2 and upper bounds on minimum ranks, Unicycle graphs and uniquely restricted maximum matchings

Cites Work

• Signsolvability revisited
• Combinatorial verification of the elementary divisors of tensor products
• On the singular graph and the Weyl characteristic of an M-matrix
• Permanent of the direct product of matrices
• Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
• The Hadamard-Fischer inequality for a class of matrices defined by eigenvalue monotonicity
• Qualitative Problems in Matrix Theory
• Qualitative Economics and the Scope of the Correspondence Principle