Related papers: Multiplicities of the structured pseudoeigenvalues
Combined perturbation bounds are presented for eigenvalues and eigenspaces of Hermitian matrices or singular values and singular subspaces of general matrices. The bounds are derived based on the smooth decompositions and elementary…
It is known that singular values of idempotent matrices are either zero or larger or equal to one \cite{HouC63}. We state exactly how many singular values greater than one, equal to one, and equal to zero there are. Moreover, we derive a…
In this paper, spectral properties of matrices with (complex) zeon entries are investigated. It is shown that when $A$ is an $m\times m$ self-adjoint matrix whose characteristic polynomial $\chi_A(u)$ has $m$ ``spectrally simple'' zeros…
In this work we prove that every locally symmetric smooth submanifold gives rise to a naturally defined smooth submanifold of the space of symmetric matrices, called spectral manifold, consisting of all matrices whose ordered vector of…
We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddable copies. To facilitate our study we introduce the notions…
We consider two seemingly unrelated questions: the relationship between nonnegative polynomials and sums of squares on real varieties, and sparse semidefinite programming. This connection is natural when a real variety $X$ is defined by a…
In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.
An arbitrary Mueller matrix can be decomposed into a sum of up to four deterministic Mueller-Jones matrices, with strengths given by the eigenvalues of an associated Hermitian matrix. A geometrical representation of the eigenvalues in terms…
A mixed graph is cospectral to its converse, with respect to the usual adjacency matrices. Hence, it is easy to see that a mixed graph whose eigenvalues occur uniquely, up to isomorphism, must be isomorphic to its converse. It is therefore…
Given a digraph D, the complementarity spectrum of the digraph is defined as the set of complementarity eigenvalues of its adjacency matrix. This complementarity spectrum has been shown to be useful in several fields, particularly in…
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…
We describe spectra of associative (not necessarily unital and not necessarily countable-dimensional) locally matrix algebras. We determine all possible spectra of locally matrix algebras and give a new proof of Dixmier-Baranov Theorem. As…
Square matrices represent linear self-maps of vector spaces, and their eigenpoints are the fixed points of the induced map on projective space. Likewise, polynomial self-maps of a projective space are represented by tensors. We study the…
We calculate the probability to find exactly $n$ eigenvalues in a spectral interval of a large random $N \times N$ matrix when this interval contains $s \ll N$ eigenvalues on average. The calculations exploit an analogy to the problem of…
In this paper, we generalize the notion of joint eigenvalues and joint spectrum of matrices and operator tupples on a bi complex Hilbert space. We observe that unlike the spectrum of a bounded operator on a bi complex Hilbert space is…
It is well known that the sum of negative (positive) eigenvalues of some finite Hermitian matrix $V$ is concave (convex) with respect to $V$. Using the theory of the spectral shift function we generalize this property to self-adjoint…
We consider square matrices over $\mathbb{C}$ satisfying an identity relating their eigenvalues and the corresponding eigenvectors re-proved and discussed by Denton, Parker, Tao and Zhang, called the eigenvector-eigenvalue identity. We…
We describe some numerical experiments which determine the degree of spectral instability of medium size randomly generated matrices which are far from self-adjoint. The conclusion is that the eigenvalues are likely to be intrinsically…
Many natural and social systems develop complex networks, that are usually modelled as random graphs. The eigenvalue spectrum of these graphs provides information about their structural properties. While the semi-circle law is known to…
We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another.…