AbstractInclusion regions for the spectrum of a hypertournament matrix A are obtained, based on a complex curve that relates the real and imaginary parts of the eigenvalues. These results generalize and in certain cases improve the work of S. Kirkland [Linear and Multilinear Algebra 30 (1991) 261]. The bounds obtained depend on the variance of the score vector; their tightness is investigated using the notion of numerical range
AbstractIn this paper, we study the joint numerical range of m-tuples of Hermitian matrices via thei...
A generalization of the method developed by Adam, Psarrakos and Tsatsomeros to find inequalities for...
This paper describes the previously unknown statistical distribution of adjacency matrix spectra for...
AbstractInclusion regions for the spectrum of a hypertournament matrix A are obtained, based on a co...
AbstractA k-hypertournament is a complete k-hypergraph with all k-edges endowed with orientations. T...
AbstractIn this work, we find a necessary and sufficient condition for the normality of an h-hyperto...
AbstractWe present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Th...
For a tournament matrix M of order n, we define its walk space, WM , to be SpanfM j 1 : j = 0; . ....
We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A ...
AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that ar...
AbstractWe present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Th...
AbstractFor a tournament matrix M of order n, we define its walk space WM to be Span{Mj1 : j = 0,…, ...
AbstractIn this work, we find a necessary and sufficient condition for the normality of an h-hyperto...
Thesis (Ph.D.), Washington State UniversityIn this dissertation we investigate the eigenspaces of to...
AbstractTo a regular hypergraph we attach an operator, called its adjacency matrix, and study the se...
AbstractIn this paper, we study the joint numerical range of m-tuples of Hermitian matrices via thei...
A generalization of the method developed by Adam, Psarrakos and Tsatsomeros to find inequalities for...
This paper describes the previously unknown statistical distribution of adjacency matrix spectra for...
AbstractInclusion regions for the spectrum of a hypertournament matrix A are obtained, based on a co...
AbstractA k-hypertournament is a complete k-hypergraph with all k-edges endowed with orientations. T...
AbstractIn this work, we find a necessary and sufficient condition for the normality of an h-hyperto...
AbstractWe present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Th...
For a tournament matrix M of order n, we define its walk space, WM , to be SpanfM j 1 : j = 0; . ....
We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A ...
AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that ar...
AbstractWe present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Th...
AbstractFor a tournament matrix M of order n, we define its walk space WM to be Span{Mj1 : j = 0,…, ...
AbstractIn this work, we find a necessary and sufficient condition for the normality of an h-hyperto...
Thesis (Ph.D.), Washington State UniversityIn this dissertation we investigate the eigenspaces of to...
AbstractTo a regular hypergraph we attach an operator, called its adjacency matrix, and study the se...
AbstractIn this paper, we study the joint numerical range of m-tuples of Hermitian matrices via thei...
A generalization of the method developed by Adam, Psarrakos and Tsatsomeros to find inequalities for...
This paper describes the previously unknown statistical distribution of adjacency matrix spectra for...