Add to ORKGThis paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by monomial matrices and negation, is equal to the number of unlabelled graphs on n vertices
Abstract. We denote by Q(A) the set of all matrices with the same sign pattern as A. A matrix A has ...
A sign pattern is a matrix whose entries belong to the set {+,−, 0}. An n-by-n sign pattern A is sai...
In this work, we investigate several natural computational problems related to identifying symmetric...
AbstractThis paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matri...
We initiate a study of the zero–nonzero patterns of n × n alternating sign matrices. We characteriz...
We initiate a study of the zero-nonzero patterns of n × n alternating sign matrices. We characterize...
AbstractA sign pattern is a matrix whose entries are elements of {+,−,0}; it describes the set of re...
AbstractAn n-by-n matrix Bn is sign nonsingular (SNS) if every matrix with the same sign pattern as ...
AbstractIn this paper, algebraic and combinatorial techniques are used to establish results concerni...
AbstractAn n×n sign pattern A allows diagonalizability if there exists a real matrix B in the qualit...
The set of real matrices described by a sign pattern (a matrix whose entries are elements of {+,−, 0...
summary:The inertia set of a symmetric sign pattern $A$ is the set $i(A)=\lbrace i(B) \mid B=B^T \in...
Finding the necessary and sufficient conditions for a sign pattern to allow diagonalizability is an ...
AbstractIn [J.Y. Shao, L.H. You, Bound on the base of irreducible generalized sign pattern matrices,...
An m by n sign pattern S is an m by n matrix with entries in {+,-, 0}. Such a sign pattern allows a ...
Abstract. We denote by Q(A) the set of all matrices with the same sign pattern as A. A matrix A has ...
A sign pattern is a matrix whose entries belong to the set {+,−, 0}. An n-by-n sign pattern A is sai...
In this work, we investigate several natural computational problems related to identifying symmetric...
AbstractThis paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matri...
We initiate a study of the zero–nonzero patterns of n × n alternating sign matrices. We characteriz...
We initiate a study of the zero-nonzero patterns of n × n alternating sign matrices. We characterize...
AbstractA sign pattern is a matrix whose entries are elements of {+,−,0}; it describes the set of re...
AbstractAn n-by-n matrix Bn is sign nonsingular (SNS) if every matrix with the same sign pattern as ...
AbstractIn this paper, algebraic and combinatorial techniques are used to establish results concerni...
AbstractAn n×n sign pattern A allows diagonalizability if there exists a real matrix B in the qualit...
The set of real matrices described by a sign pattern (a matrix whose entries are elements of {+,−, 0...
summary:The inertia set of a symmetric sign pattern $A$ is the set $i(A)=\lbrace i(B) \mid B=B^T \in...
Finding the necessary and sufficient conditions for a sign pattern to allow diagonalizability is an ...
AbstractIn [J.Y. Shao, L.H. You, Bound on the base of irreducible generalized sign pattern matrices,...
An m by n sign pattern S is an m by n matrix with entries in {+,-, 0}. Such a sign pattern allows a ...
Abstract. We denote by Q(A) the set of all matrices with the same sign pattern as A. A matrix A has ...
A sign pattern is a matrix whose entries belong to the set {+,−, 0}. An n-by-n sign pattern A is sai...
In this work, we investigate several natural computational problems related to identifying symmetric...