AbstractAnother, more elementary proof is given of Proposition 2.3 in a recent paper by Dietrich Burde. This proposition says that n×n matrices A and X over an algebraically closed field K of characteristic zero satisfying the equality in the title of this paper can be simultaneously triangularized. The proposed proof is based on the Shemesh criterion for two matrices to have a common eigenvector
AbstractIn this paper we describe, in combinatorial terms, some matrices which arise as Laplacians c...
AbstractWe study the well-known Sylvester equation XA − BX = R in the case when A and B are given an...
AbstractWe consider the problem of simultaneously putting a set of square matrices into the same blo...
AbstractAnother, more elementary proof is given of Proposition 2.3 in a recent paper by Dietrich Bur...
AbstractLet S be a set of n × n matrices over a field F, and A the algebra generated by S over F. Th...
AbstractLet A = (aij) be an n-square matrix over an arbitrary field K, and let w1,…,wn be elements o...
AbstractLet A,B be n×n matrices with entries in an algebraically closed field F of characteristic ze...
AbstractA computable criterion is given for two square matrices to possess a common eigenvector, as ...
International audienceWe show that a pair of matrices satisfying a certain algebraic identity, remin...
International audienceWe show that a pair of matrices satisfying a certain algebraic identity, remin...
International audienceWe show that a pair of matrices satisfying a certain algebraic identity, remin...
AbstractIt is shown that a 2×2 complex matrix A is diagonally equivalent to a matrix with two distin...
AbstractA finite rational procedure of the Shemesh type is proposed to check whether given complex n...
AbstractA classical approach used to obtain basic facts in the theory of square matrices involves an...
AbstractA classical approach used to obtain basic facts in the theory of square matrices involves an...
AbstractIn this paper we describe, in combinatorial terms, some matrices which arise as Laplacians c...
AbstractWe study the well-known Sylvester equation XA − BX = R in the case when A and B are given an...
AbstractWe consider the problem of simultaneously putting a set of square matrices into the same blo...
AbstractAnother, more elementary proof is given of Proposition 2.3 in a recent paper by Dietrich Bur...
AbstractLet S be a set of n × n matrices over a field F, and A the algebra generated by S over F. Th...
AbstractLet A = (aij) be an n-square matrix over an arbitrary field K, and let w1,…,wn be elements o...
AbstractLet A,B be n×n matrices with entries in an algebraically closed field F of characteristic ze...
AbstractA computable criterion is given for two square matrices to possess a common eigenvector, as ...
International audienceWe show that a pair of matrices satisfying a certain algebraic identity, remin...
International audienceWe show that a pair of matrices satisfying a certain algebraic identity, remin...
International audienceWe show that a pair of matrices satisfying a certain algebraic identity, remin...
AbstractIt is shown that a 2×2 complex matrix A is diagonally equivalent to a matrix with two distin...
AbstractA finite rational procedure of the Shemesh type is proposed to check whether given complex n...
AbstractA classical approach used to obtain basic facts in the theory of square matrices involves an...
AbstractA classical approach used to obtain basic facts in the theory of square matrices involves an...
AbstractIn this paper we describe, in combinatorial terms, some matrices which arise as Laplacians c...
AbstractWe study the well-known Sylvester equation XA − BX = R in the case when A and B are given an...
AbstractWe consider the problem of simultaneously putting a set of square matrices into the same blo...
DOI
Add to ORKG