Abstract
A sign pattern matrix (or nonnegative sign pattern matrix) is a matrix whose entries are from the set {+,−, 0} ({+, 0}, respectively). The minimum rank (or rational minimum rank) of a sign pattern matrix A is the minimum of the ranks of the matrices (rational matrices, respectively) whose entries have signs equal to the corresponding entries of A. Using a correspondence between sign patterns with minimum rank r ≥ 2 and point-hyperplane configurations in Rr−1 and Steinitz’s theorem on the rational realizability of 3-polytopes, it is shown that for every nonnegative sign pattern of minimum rank at most 4, the minimum rank and the rational minimum rank are equal. But there are nonnegative sign patterns with minimum rank 5 whose rational minimum rank is greater than 5. It is established that every d-polytope determines a nonnegative sign pattern with minimum rank d + 1 that has a (d + 1) × (d + 1) triangular submatrix with all diagonal entries positive. It is also shown that there are at most min{3m, 3n} zero entries in any condensed nonnegative m × n sign pattern of minimum rank 3. Some bounds on the entries of some integer matrices achieving the minimum ranks of nonnegative sign patterns with minimum rank 3 or 4 are established.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
N. Alon, P. Frankl, V. Rödl: Geometric realization of set systems and probabilistic communication complexity. Proc. 26th Annual Symp. on Foundations of Computer Science. IEEE Computer Society, Portland, 1985, pp. 272–280.
M. Arav, F. Hall, S. Koyuncu, Z. Li, B. Rao: Rational realizations of the minimum rank of a sign pattern matrix. Linear Algebra Appl. 409 (2005), 111–125.
M. Arav, F. Hall, Z. Li, A. Merid, Y. Gao: Sign patterns that require almost unique rank. Linear Algebra Appl. 430 (2009), 7–16.
M. Arav, F. Hall, Z. Li, B. Rao: Rational solutions of certain matrix equations. Linear Algebra Appl. 430 (2009), 660–663.
M. Arav, F. Hall, Z. Li, H. van der Holst, J. H. Sinkovic, L. Zhang: Minimum ranks of sign patterns via sign vectors and duality. Electron. J. Linear Algebra 30 (2015), 360–371.
A. Berman, S. Friedland, L. Hogben, U. G. Rothblum, B. Shader: Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers. Electron. J. Comb. 15 (2008), 1–19.
R. Brualdi, S. Fallat, L. Hogben, B. Shader, P. van den Driessche: Final Report: Workshop on Theory and Applications of Matrices described by Patterns. Banff International Research Station, 2010, 20 pages.
R. A. Brualdi, B. L. Shader: Matrices of Sign-Solvable Linear Systems. Cambridge Tracts in Mathematics 116, Cambridge University Press, Cambridge, 1995.
G. Chen, F. J. Hall, Z. Li, B. Wei: On ranks of matrices associated with trees. Graphs Comb. 19 (2003), 323–334.
P. Delsarte, Y. Kamp: Low rank matrices with a given sign pattern. SIAM J. Discrete Math. 2 (1989), 51–63.
W. Fang, W. Gao, Y. Gao, F. Gong, G. Jing, Z. Li, Y. Shao, L. Zhang: Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations. Submitted to Linear Algebra Appl.
M. Fiedler, W. Gao, F. J. Hall, G. Jing, Z. Li, M. Stroev: Ranks of dense alternating sign matrices and their sign patterns. Linear Algebra Appl. 471 (2015), 109–121.
J. Forster: A linear lower bound on the unbounded error probabilistic communication complexity. J. Comput. Syst. Sci. 65 (2002), 612–625.
J. Forster, N. Schmitt, H. U. Simon, T. Suttorp: Estimating the optimal margins of embeddings in Euclidean half spaces. Mach. Learn. 51 (2003), 263–281.
M. Friesen, A. Hamed, T. Lee, D. O. Theis: Fooling-sets and rank. Eur. J. Comb. (2015), 143–153.
R. L. Graham, M. Grötschel, L. Lovász, eds.: Handbook of Combinatorics. MIT Press, Cambridge, 1995.
F. J. Hall, Z. Li: Sign Pattern Matrices. Handbook of Linear Algebra (L. Hogben, ed.). Discrete Mathematics and Its Applications, Chapman & Hall/CRC, Boca Raton, 2014.
D. Hershkowitz, H. Schneider: Ranks of zero patterns and sign patterns. Linear Multilinear Algebra 34 (1993), 3–19.
C. R. Johnson: Some outstanding problems in the theory of matrices. Linear Multilinear Algebra 12 (1982), 99–108.
C. R. Johnson, Y. Zhang: On the possible ranks among matrices with a given pattern. Discrete Math. Algorithms Appl. 2 (2010), 363–377.
S. Kopparty, K. P. S. B. Rao: The minimum rank problem: a counterexample. Linear Algebra Appl. 428 (2008), 1761–1765.
Z. Li, Y. Gao, M. Arav, F. Gong, W. Gao, F. J. Hall, H. van der Holst: Sign patterns with minimum rank 2 and upper bounds on minimum ranks. Linear Multilinear Algebra 61 (2013), 895–908.
J. Matoušek: Lectures on Discrete Geometry. Graduate Texts in Mathematics 212, Springer, New York, 2002.
R. Paturi, J. Simon: Probabilistic communication complexity. J. Comput. Syst. Sci. 33 (1986), 106–123.
A. A. Razborov, A. A. Sherstov: The sign rank of AC0. SIAM J. Comput. 39 (2010), 1833–1855.
A. Ribó Mor, G. Rote, A. Schulz: Small grid embeddings of 3-polytopes. Discrete Comput. Geom. 45 (2011), 65–87.
Y. Shitov: Sign patterns of rational matrices with large rank. Eur. J. Comb. 42 (2014), 107–111.
G. M. Ziegler: Lectures on Polytopes. Graduate Texts in Mathematics 152, Springer, Berlin, 1995.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Dedicated to the memory of Miroslav Fiedler
Rights and permissions
About this article
Cite this article
Fang, W., Gao, W., Gao, Y. et al. Rational realization of the minimum ranks of nonnegative sign pattern matrices. Czech Math J 66, 895–911 (2016). https://doi.org/10.1007/s10587-016-0299-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-016-0299-1
Keywords
- sign pattern (matrix)
- nonnegative sign pattern
- minimum rank
- convex polytope
- rational minimum rank
- rational realization
- integer matrix
- condensed sign pattern
- point-hyperplane configuration