Related papers: On Matrices Whose Distinct Eigenvalues Are Fully C…
Given a matrix with partitions of its rows and columns and entries from a field, we give the necessary and sufficient conditions that it has a non--singular submatrix with certain number of rows from each row partition and certain number of…
The parameter $q(G)$ of a graph $G$ is the minimum number of distinct eigenvalues of a symmetric matrix whose pattern is given by $G$. We introduce a novel graph product by which we construct new infinite families of graphs that achieve…
We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…
We investigate the set of quantum states that can be shown to be $k$-incoherent based only on their eigenvalues (equivalently, we explore which Hermitian matrices can be shown to have small factor width based only on their eigenvalues). In…
It is well known that the set of all $ n \times n $ matrices with distinct eigenvalues is a dense subset of the set of all real or complex $ n \times n $ matrices. In [Hartfiel, D. J. Dense sets of diagonalizable matrices. Proc. Amer. Math.…
We classify $n\times n$-matrix-valued continuous commutativity and spectrum preservers defined on spaces of (a) normal, (b) semisimple and (c) arbitrary $n\times n$ matrices with spectra contained in sufficiently connected subsets…
We introduce a class of $M \times M$ sample covariance matrices $\mathcal Q$ which subsumes and generalizes several previous models. The associated population covariance matrix $\Sigma = \mathbb E \cal Q$ is assumed to differ from the…
We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…
The signless Laplacian matrix of a graph $G$ is defined to be the sum of its adjacency matrix and degree diagonal matrix, and its eigenvalues are called $Q$-eigenvalues of $G$. A $Q$-eigenvalue of a graph $G$ is called a $Q$-main eigenvalue…
We give a complete combinatorial characterization of homogeneous quadratic relations of "universal character" valid for minors of quantum matrices (more precisely, for minors in the quantized coordinate ring $O_q(M_{m,n}(K))$ of $m\times n$…
The distributions of the smallest and largest eigenvalues for the matrix product $Z^\dagger Z$, where $Z$ is an $n \times m$ complex Gaussian matrix with correlations both along rows and down columns, are expressed as $m \times m$…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
We study the right eigenvalue equation for quaternionic and complex linear matrix operators defined in n-dimensional quaternionic vector spaces. For quaternionic linear operators the eigenvalue spectrum consists of n complex values. For…
Consider a quantum cat map $M$ associated to a matrix $A\in\mathop{\mathrm{Sp}}(2n,\mathbb Z)$, which is a common toy model in quantum chaos. We show that the mass of eigenfunctions of $M$ on any nonempty open set in the position-frequency…
A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their order are apportionable. General results are established and…
For positive integers $1 \leq k \leq n$ let $M_n$ be the algebra of all $n \times n$ complex matrices and $M_n^{\le k}$ its subset consisting of all matrices of rank at most $k$. We first show that whenever $k>\frac{n}{2}$, any continuous…
In this paper, we present an equitable partition theorem of tensors, which gives the relations between $H$-eigenvalues of a tensor and its quotient equitable tensor and extends the equitable partitions of graphs to hypergraphs. Furthermore,…
In this note, we present a generalization of some results concerning the spectral properties of a certain class of block matrices. As applications, we study some of its implications on nonnegative matrices, doubly stochastic matrices and…
The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…
In [M. Walter et al., Science 340, 1205, 7 June (2013)], they gave a sufficient condition for genuinely entangled pure states and discussed SLOCC classification via polytopes and the eigenvalues of the single-particle states. In this paper,…