AbstractAn algorithm to obtain a completion of a partial upper triangular matrices with prescribed eigenvalues and their multiplicities, and the Jordan chains of the completed matrix is introduced. This algorithm extends some results of Rodman and Shalom in Linear Algebra and Appl. 168 (1992) 221–249
A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative...
AbstractThroughout the last decades, several results have been published in the area of the so-calle...
The set of n by n upper-triangular nilpotent matrices with entries in a finite field q has Jordan ca...
AbstractAn algorithm to obtain a completion of a partial upper triangular matrices with prescribed e...
AbstractWe give a counterexample to a conjecture about the possible Jordan normal forms of nilpotent...
AbstractRodman and Shalom present in Linear Algebra Appl. 168:221–249 (1992) two completion conjectu...
AbstractA sufficient condition for a set of positive integers {g1,g2,...,gn} to be the geometric mul...
AbstractJordan forms of completions of partial Jordan matrices are studied. Our approach is based on...
AbstractJordan structures of strictly lower triangular completions of matrices over an algebraically...
AbstractIn this paper five questions related with the existence of nilpotent completions of partial ...
AbstractA pair (A, B), where A is an n x n matrix and B is an n x m matrix, is said to have the nonn...
AbstractA pair (A, B), where A is an n × n matrix and B is an n × m matrix, is said to have the nonn...
A new necessary and sufficient condition for the existence of an m-th root of a nilpotent matrix in ...
AbstractA complete solution of the matrix completion problemA??B−1=?CD?is obtained in terms of solut...
A real n x n matrix is a Q-matrix if for every k = 1, 2, . . . , n the sum of all k x k principal mi...
A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative...
AbstractThroughout the last decades, several results have been published in the area of the so-calle...
The set of n by n upper-triangular nilpotent matrices with entries in a finite field q has Jordan ca...
AbstractAn algorithm to obtain a completion of a partial upper triangular matrices with prescribed e...
AbstractWe give a counterexample to a conjecture about the possible Jordan normal forms of nilpotent...
AbstractRodman and Shalom present in Linear Algebra Appl. 168:221–249 (1992) two completion conjectu...
AbstractA sufficient condition for a set of positive integers {g1,g2,...,gn} to be the geometric mul...
AbstractJordan forms of completions of partial Jordan matrices are studied. Our approach is based on...
AbstractJordan structures of strictly lower triangular completions of matrices over an algebraically...
AbstractIn this paper five questions related with the existence of nilpotent completions of partial ...
AbstractA pair (A, B), where A is an n x n matrix and B is an n x m matrix, is said to have the nonn...
AbstractA pair (A, B), where A is an n × n matrix and B is an n × m matrix, is said to have the nonn...
A new necessary and sufficient condition for the existence of an m-th root of a nilpotent matrix in ...
AbstractA complete solution of the matrix completion problemA??B−1=?CD?is obtained in terms of solut...
A real n x n matrix is a Q-matrix if for every k = 1, 2, . . . , n the sum of all k x k principal mi...
A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative...
AbstractThroughout the last decades, several results have been published in the area of the so-calle...
The set of n by n upper-triangular nilpotent matrices with entries in a finite field q has Jordan ca...
DOI
Add to ORKG