Let λ be an eigenvalue of an n-by-n matrix A. The allowable patterns of geometric multiplicities of λ as an eigenvalue of A and its principal submatrices is explored. A graphical hierarchy for succinctly reporting the possible patterns is defined. Special attention is paid to the case in which A is Hermitian. Classical interlacing already imposes much structure on the hierarchies in the Hermitian case. Here, all the known constraints, some old and some new, on the geometric multiplicity hierarchies of Hermitian matrices are listed. Some differences between allowed hierarchies for real symmetric matrices and Hermitian matrices are also discussed
In this thesis we study the relation between two problems of linear algebra concerning eigenvalues o...
The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, M1, was understood full...
Here we investigate the relation between perturbing the i-th diagonal entry of A 2 Mn(F) and extrac...
AbstractLet λ be an eigenvalue of an n-by-n matrix A. The allowable patterns of geometric multiplici...
It is a straightforward matrix calculation that if λ is an eigenvalue of A, x an associated eigenvec...
Given a certain tree, we explore what we can infer about the eigenvalue multiplicities for a Hermiti...
AbstractThere is remarkable and distinctive structure among Hermitian matrices, whose graph is a giv...
AbstractAmong the possible multiplicity lists for the eigenvalues of Hermitian matrices whose graph ...
AbstractWe consider the general problem of determining which lists of multiplicities for the eigenva...
Given an n-by-n Hermitian matrix A and a real number λ, index i is said to be Parter (resp. neutral,...
Abstract There is remarkable and distinctive structure among Hermitian matrices, whose graph is a gi...
An important theorem about the existence of principal submatrices of a Hermitian matrixwhose graph i...
Sem PDF conforme despacho.For a given graph, there is a natural question of the possible lists of mu...
Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact ...
Copyright c © 2014 Rachid Marsli and Frank J. Hall. This is an open access article distributed under...
In this thesis we study the relation between two problems of linear algebra concerning eigenvalues o...
The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, M1, was understood full...
Here we investigate the relation between perturbing the i-th diagonal entry of A 2 Mn(F) and extrac...
AbstractLet λ be an eigenvalue of an n-by-n matrix A. The allowable patterns of geometric multiplici...
It is a straightforward matrix calculation that if λ is an eigenvalue of A, x an associated eigenvec...
Given a certain tree, we explore what we can infer about the eigenvalue multiplicities for a Hermiti...
AbstractThere is remarkable and distinctive structure among Hermitian matrices, whose graph is a giv...
AbstractAmong the possible multiplicity lists for the eigenvalues of Hermitian matrices whose graph ...
AbstractWe consider the general problem of determining which lists of multiplicities for the eigenva...
Given an n-by-n Hermitian matrix A and a real number λ, index i is said to be Parter (resp. neutral,...
Abstract There is remarkable and distinctive structure among Hermitian matrices, whose graph is a gi...
An important theorem about the existence of principal submatrices of a Hermitian matrixwhose graph i...
Sem PDF conforme despacho.For a given graph, there is a natural question of the possible lists of mu...
Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact ...
Copyright c © 2014 Rachid Marsli and Frank J. Hall. This is an open access article distributed under...
In this thesis we study the relation between two problems of linear algebra concerning eigenvalues o...
The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, M1, was understood full...
Here we investigate the relation between perturbing the i-th diagonal entry of A 2 Mn(F) and extrac...