AbstractThe problem of characterizing potentially stable sign-pattern matrices remains unsolved, even for tree patterns. We present here in tabular form all (irreducible) n-by-n potentially stable sign patterns whose undirected graphs are trees, for n<5, in hopes that this may be useful to others in formulating and evaluating conjectures on the subject. Some background and a descriptio of methodology (which includes some new theoretical ideas) are also included
AbstractSufficient conditions are determined for an n-by-n zero-nonzero pattern to allow a nested se...
AbstractA sign pattern is said to be potentially nilpotent if it allows nilpotence. In this paper, a...
A sign pattern is a matrix with entries in {+,-, 0}. A full sign pattern has no zero entries. The re...
AbstractA sign pattern matrix A is called potentially stable if there exists a real matrix B∈Q(A) su...
AbstractA square sign pattern A is potentially stable (PS) if there exists a real matrix having the ...
A sign pattern is a matrix whose entries belong to the set {+,−, 0}. An n-by-n sign pattern A is sai...
A sign pattern is a matrix whose entries belong to the set {+,−, 0}. An n-by-n sign pattern A is sai...
A sign pattern (matrix) is a matrix whose entries are from the set {+,–, 0}. A sign pattern matrix A...
Thesis (Ph. D.)--University of Washington, 1985A matrix A is sign stable if some matrix with the sam...
AbstractA sign pattern is said to be potentially nilpotent if it allows nilpotence. In this paper, a...
summary:A matrix $\Cal A$ whose entries come from the set $\{+,-,0\}$ is called a {\it sign pattern ...
The topic of matrix stability is very important for determining the stability of solutions to system...
Abstract. A sign pattern matrix (or a sign pattern, or a pattern) is a matrix whose entries are from...
summary:A matrix $\Cal A$ whose entries come from the set $\{+,-,0\}$ is called a {\it sign pattern ...
AbstractAn n×n sign pattern matrix has entries in {+,-,0}. This paper surveys the following problems...
AbstractSufficient conditions are determined for an n-by-n zero-nonzero pattern to allow a nested se...
AbstractA sign pattern is said to be potentially nilpotent if it allows nilpotence. In this paper, a...
A sign pattern is a matrix with entries in {+,-, 0}. A full sign pattern has no zero entries. The re...
AbstractA sign pattern matrix A is called potentially stable if there exists a real matrix B∈Q(A) su...
AbstractA square sign pattern A is potentially stable (PS) if there exists a real matrix having the ...
A sign pattern is a matrix whose entries belong to the set {+,−, 0}. An n-by-n sign pattern A is sai...
A sign pattern is a matrix whose entries belong to the set {+,−, 0}. An n-by-n sign pattern A is sai...
A sign pattern (matrix) is a matrix whose entries are from the set {+,–, 0}. A sign pattern matrix A...
Thesis (Ph. D.)--University of Washington, 1985A matrix A is sign stable if some matrix with the sam...
AbstractA sign pattern is said to be potentially nilpotent if it allows nilpotence. In this paper, a...
summary:A matrix $\Cal A$ whose entries come from the set $\{+,-,0\}$ is called a {\it sign pattern ...
The topic of matrix stability is very important for determining the stability of solutions to system...
Abstract. A sign pattern matrix (or a sign pattern, or a pattern) is a matrix whose entries are from...
summary:A matrix $\Cal A$ whose entries come from the set $\{+,-,0\}$ is called a {\it sign pattern ...
AbstractAn n×n sign pattern matrix has entries in {+,-,0}. This paper surveys the following problems...
AbstractSufficient conditions are determined for an n-by-n zero-nonzero pattern to allow a nested se...
AbstractA sign pattern is said to be potentially nilpotent if it allows nilpotence. In this paper, a...
A sign pattern is a matrix with entries in {+,-, 0}. A full sign pattern has no zero entries. The re...