DOIAbstract
Finding the necessary and sufficient conditions for a sign pattern to allow diagonalizability is an open problem. In this paper, we identify sign patterns of up to four orders that allow diagonalizability
Finding the necessary and sufficient conditions for a sign pattern to allow diagonalizability is an open problem. In this paper, we identify sign patterns of up to four orders that allow diagonalizability
A sign pattern (matrix) is a matrix whose entries are from the set {+, -, 0}. We say that a sign pat...
AbstractAn n×n sign pattern matrix has entries in {+,-,0}. This paper surveys the following problems...
A sign pattern matrix is a matrix whose entries are from the set {+,−, 0}. For a real matrix B, sgn(...
Finding the necessary and sufficient conditions for a sign pattern to allow diagonalizability is an ...
AbstractAn n×n sign pattern A allows diagonalizability if there exists a real matrix B in the qualit...
AbstractMotivated by the question of which sign patterns allow a diagonalizable matrix, we relate a ...
Allowing diagonalizability of sign pattern is still an open problem. In this paper, we make a carefu...
A sign pattern matrix is a matrix whose entries in the set f+;��; 0g.These matrices are used to desc...
A sign pattern is a matrix whose entries belong to the set {+,−, 0}. An n-by-n sign pattern A is sai...
summary:A sign pattern $A$ is a $\pm $ sign pattern if $A$ has no zero entries. $A$ allows orthog...
AbstractSuppose P is a property referring to a real matrix. We say that a sign pattern A allows P if...
AbstractWe first characterize the n-by-n irreducible sign-pattern matrices A that are sign idempoten...
AbstractA sign pattern matrix is a matrix whose entries are from the set {+,-,0}. For a real matrix ...
Abstract. A sign pattern matrix (or a sign pattern, or a pattern) is a matrix whose entries are from...
AbstractA sign pattern is said to be potentially nilpotent if it allows nilpotence. In this paper, a...
A sign pattern (matrix) is a matrix whose entries are from the set {+, -, 0}. We say that a sign pat...
AbstractAn n×n sign pattern matrix has entries in {+,-,0}. This paper surveys the following problems...
A sign pattern matrix is a matrix whose entries are from the set {+,−, 0}. For a real matrix B, sgn(...
Finding the necessary and sufficient conditions for a sign pattern to allow diagonalizability is an ...
AbstractAn n×n sign pattern A allows diagonalizability if there exists a real matrix B in the qualit...
AbstractMotivated by the question of which sign patterns allow a diagonalizable matrix, we relate a ...
Allowing diagonalizability of sign pattern is still an open problem. In this paper, we make a carefu...
A sign pattern matrix is a matrix whose entries in the set f+;��; 0g.These matrices are used to desc...
A sign pattern is a matrix whose entries belong to the set {+,−, 0}. An n-by-n sign pattern A is sai...
summary:A sign pattern $A$ is a $\pm $ sign pattern if $A$ has no zero entries. $A$ allows orthog...
AbstractSuppose P is a property referring to a real matrix. We say that a sign pattern A allows P if...
AbstractWe first characterize the n-by-n irreducible sign-pattern matrices A that are sign idempoten...
AbstractA sign pattern matrix is a matrix whose entries are from the set {+,-,0}. For a real matrix ...
Abstract. A sign pattern matrix (or a sign pattern, or a pattern) is a matrix whose entries are from...
AbstractA sign pattern is said to be potentially nilpotent if it allows nilpotence. In this paper, a...
A sign pattern (matrix) is a matrix whose entries are from the set {+, -, 0}. We say that a sign pat...
AbstractAn n×n sign pattern matrix has entries in {+,-,0}. This paper surveys the following problems...
A sign pattern matrix is a matrix whose entries are from the set {+,−, 0}. For a real matrix B, sgn(...
Add to ORKG