AbstractSufficient conditions are determined for an n-by-n zero-nonzero pattern to allow a nested sequence of nonzero principal minors. A method is then given to sign such a pattern so that it allows a nested sequence of k-by-k principal minors with sign (−1)k for 1 ⩽ k ⩽ n. It is a classical result that a sign pattern with such a sequence is potentially stable; thus classes of potentially stable sign patterns can be identified. A necessary and sufficient condition for a certain tree sign-pattern class to be potentially stable is also given
AbstractA sign pattern is said to be potentially nilpotent if it allows nilpotence. In this paper, a...
AbstractAn n×n real matrix is called sign regular if, for each k (1⩽k⩽n), all its minors of order k ...
AbstractSuppose P is a property referring to a real matrix. We say that a sign pattern A allows P if...
AbstractA square sign pattern A is potentially stable (PS) if there exists a real matrix having the ...
AbstractA matrix A∈Mn(R) has a nest of positive principal minors if PAPT has positive leading princi...
AbstractA sign pattern matrix A is called potentially stable if there exists a real matrix B∈Q(A) su...
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...
AbstractThe problem of characterizing potentially stable sign-pattern matrices remains unsolved, eve...
A sign pattern is a matrix with entries in {+,-, 0}. A full sign pattern has no zero entries. The re...
Given a real symmetric n×n matrix, the sepr-sequence t1⋯tn records information about the existence o...
A sign pattern is a matrix with entries in {+,-, 0}. A full sign pattern has no zero entries. The re...
summary:A matrix $\Cal A$ whose entries come from the set $\{+,-,0\}$ is called a {\it sign pattern ...
Abstract. A sign pattern matrix (or a sign pattern, or a pattern) is a matrix whose entries are from...
AbstractA nonzero pattern is a matrix with entries in {0,∗}. A pattern is potentially nilpotent if t...
AbstractA sign pattern is said to be potentially nilpotent if it allows nilpotence. In this paper, a...
AbstractAn n×n real matrix is called sign regular if, for each k (1⩽k⩽n), all its minors of order k ...
AbstractSuppose P is a property referring to a real matrix. We say that a sign pattern A allows P if...
AbstractA square sign pattern A is potentially stable (PS) if there exists a real matrix having the ...
AbstractA matrix A∈Mn(R) has a nest of positive principal minors if PAPT has positive leading princi...
AbstractA sign pattern matrix A is called potentially stable if there exists a real matrix B∈Q(A) su...
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...
AbstractThe problem of characterizing potentially stable sign-pattern matrices remains unsolved, eve...
A sign pattern is a matrix with entries in {+,-, 0}. A full sign pattern has no zero entries. The re...
Given a real symmetric n×n matrix, the sepr-sequence t1⋯tn records information about the existence o...
A sign pattern is a matrix with entries in {+,-, 0}. A full sign pattern has no zero entries. The re...
summary:A matrix $\Cal A$ whose entries come from the set $\{+,-,0\}$ is called a {\it sign pattern ...
Abstract. A sign pattern matrix (or a sign pattern, or a pattern) is a matrix whose entries are from...
AbstractA nonzero pattern is a matrix with entries in {0,∗}. A pattern is potentially nilpotent if t...
AbstractA sign pattern is said to be potentially nilpotent if it allows nilpotence. In this paper, a...
AbstractAn n×n real matrix is called sign regular if, for each k (1⩽k⩽n), all its minors of order k ...
AbstractSuppose P is a property referring to a real matrix. We say that a sign pattern A allows P if...