Publication date
May 1999
DOI Publisher
Elsevier Science Inc. ISSN
0024-3795Abstract
AbstractWe discuss pattern problems for matrix groups and solve one of such problems for a class of nilpotent groups
AbstractWe discuss pattern problems for matrix groups and solve one of such problems for a class of nilpotent groups
AbstractA sign pattern is said to be nilpotent of index k if all real matrices in its qualitative cl...
AbstractIn this paper we study the extremal problem of finding how many 1 entries an n by n 0–1 matr...
A sign pattern(matrix) is a matrix whose entries are from the set {+,-,0}. An n x n sign pattern mat...
AbstractWe discuss pattern problems for matrix groups and solve one of such problems for a class of ...
A subspace of the space, L(n), of traceless complex n x n matrices can be specified by requiring tha...
AbstractAn n×n sign pattern matrix S is an inertially arbitrary pattern (IAP) if each nonnegative tr...
AbstractA nonzero pattern is a matrix with entries in {0,∗}. A pattern is potentially nilpotent if t...
AbstractAn n-by-n sign pattern A is a matrix with entries in {+,-,0}. An n-by-n nonzero pattern A is...
AbstractA nonzero pattern is a matrix with entries in {0,∗}. A pattern is potentially nilpotent if t...
AbstractA subspace of the space, L(n), of traceless complex n×n matrices can be specified by requiri...
AbstractAn n-by-n sign pattern A is a matrix with entries in {+,-,0}. An n-by-n nonzero pattern A is...
AbstractIf A is an n × n sign pattern matrix, then Q(A) denotes the set of all real n×n matrices B s...
AbstractThe zero–nonzero patterns occurring among m-by-n matrices with given row and column sums are...
AbstractAn n×n real matrix is called sign regular if, for each k (1⩽k⩽n), all its minors of order k ...
AbstractA nonsingular sign pattern H is said to require property P if every matrix A in its sign cla...
AbstractA sign pattern is said to be nilpotent of index k if all real matrices in its qualitative cl...
AbstractIn this paper we study the extremal problem of finding how many 1 entries an n by n 0–1 matr...
A sign pattern(matrix) is a matrix whose entries are from the set {+,-,0}. An n x n sign pattern mat...
AbstractWe discuss pattern problems for matrix groups and solve one of such problems for a class of ...
A subspace of the space, L(n), of traceless complex n x n matrices can be specified by requiring tha...
AbstractAn n×n sign pattern matrix S is an inertially arbitrary pattern (IAP) if each nonnegative tr...
AbstractA nonzero pattern is a matrix with entries in {0,∗}. A pattern is potentially nilpotent if t...
AbstractAn n-by-n sign pattern A is a matrix with entries in {+,-,0}. An n-by-n nonzero pattern A is...
AbstractA nonzero pattern is a matrix with entries in {0,∗}. A pattern is potentially nilpotent if t...
AbstractA subspace of the space, L(n), of traceless complex n×n matrices can be specified by requiri...
AbstractAn n-by-n sign pattern A is a matrix with entries in {+,-,0}. An n-by-n nonzero pattern A is...
AbstractIf A is an n × n sign pattern matrix, then Q(A) denotes the set of all real n×n matrices B s...
AbstractThe zero–nonzero patterns occurring among m-by-n matrices with given row and column sums are...
AbstractAn n×n real matrix is called sign regular if, for each k (1⩽k⩽n), all its minors of order k ...
AbstractA nonsingular sign pattern H is said to require property P if every matrix A in its sign cla...
AbstractA sign pattern is said to be nilpotent of index k if all real matrices in its qualitative cl...
AbstractIn this paper we study the extremal problem of finding how many 1 entries an n by n 0–1 matr...
A sign pattern(matrix) is a matrix whose entries are from the set {+,-,0}. An n x n sign pattern mat...
Add to ORKG