Identified are a number of conditions on square patterns that are closely related to allowing commutativity with the full pattern. Implications and examples that show non-implications are given, along with a graph that summarizes the provided information. A complete description of commutativity with the full pattern is given in both the irreducible case and the reducible case in which there are two irreducible components.info:eu-repo/semantics/publishedVersio
A sign pattern (matrix) is a matrix whose entries are from the set {+, -, 0}. We say that a sign pat...
Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we d...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
Identified are a number of conditions on square patterns that are closely related to allowing commut...
An integral property of all matrices is that multiplication is not commutative, that is, given two m...
In this thesis we study algebraic sets of tuples whose entries are mutually com- muting matrices pos...
Es reproducción del documento publicado en http://dx.doi.org/10.1155/2009/650970This paper investiga...
AbstractAfter showing (see Theorem 2.8) how commuting squares lead, in the presence of a certain add...
Though some special cases are now understood, the characterization of TP-completable patterns is far...
A matrix is called totally nonnegative (TN) if the determinant of every square submatrix is nonnegat...
AbstractWe investigate the role of commutativity in query processing of linear recursion. We give a ...
We study the possible numbers of nonconstant invariant polynomials of the matrix commutator XA - AX,...
Fully commutative elements in types $B$ and $D$ are completely characterized and counted by Stembrid...
We first give a complete list of polynomial conditions on the data for TP (TN) completability of par...
AbstractWe give a combinatorial proof of Jacobi's equality relating a cofactor of a matrix with the ...
A sign pattern (matrix) is a matrix whose entries are from the set {+, -, 0}. We say that a sign pat...
Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we d...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
Identified are a number of conditions on square patterns that are closely related to allowing commut...
An integral property of all matrices is that multiplication is not commutative, that is, given two m...
In this thesis we study algebraic sets of tuples whose entries are mutually com- muting matrices pos...
Es reproducción del documento publicado en http://dx.doi.org/10.1155/2009/650970This paper investiga...
AbstractAfter showing (see Theorem 2.8) how commuting squares lead, in the presence of a certain add...
Though some special cases are now understood, the characterization of TP-completable patterns is far...
A matrix is called totally nonnegative (TN) if the determinant of every square submatrix is nonnegat...
AbstractWe investigate the role of commutativity in query processing of linear recursion. We give a ...
We study the possible numbers of nonconstant invariant polynomials of the matrix commutator XA - AX,...
Fully commutative elements in types $B$ and $D$ are completely characterized and counted by Stembrid...
We first give a complete list of polynomial conditions on the data for TP (TN) completability of par...
AbstractWe give a combinatorial proof of Jacobi's equality relating a cofactor of a matrix with the ...
A sign pattern (matrix) is a matrix whose entries are from the set {+, -, 0}. We say that a sign pat...
Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we d...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...