Related papers: On the eigenvalues of combined meet and join matri…
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition…
We study the stability of synchronized fixed-point state for linear fractional-order coupled map lattice(CML). We observe that the eigenvalues of the connectivity matrix determine the stability as for integer-order CML. These eigenvalues…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
In this paper, we study eigenvalues of the poly-Laplacian with arbitrary order on a bounded domain in an $n$-dimensional Euclidean space and obtain a lower bound for eigenvalues, which gives an important improvement of results due to Levine…
This note is about uniform, plane, singly connected, regular Hall-plates with an arbitrary number of contacts exposed to a uniform magnetic field of arbitrary strength. In practice, the regular symmetry is the most common one. If the…
We study concentration inequalities for structured weighted sums of random data, including (i) tensor inner products and (ii) sequential matrix sums. We are interested in tail bounds and concentration inequalities for those structured…
For bound states of atoms and molecules of $N$ electrons we consider the corresponding $K$-particle reduced density matrices, $\Gamma^{(K)}$, for $1 \le K \le N-1$. Previously, eigenvalue bounds were obtained in the case of $K=1$ and…
In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.
Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…
Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…
In this paper we characterise the indeterminate case by the eigenvalues of the Hankel matrices being bounded below by a strictly positive constant. An explicit lower bound is given in terms of the orthonormal polynomials and we find…
A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…
Inequalities for the eigenvalues of the (negative) Laplacian subject to mixed boundary conditions on polyhedral and more general bounded domains are established. The eigenvalues subject to a Dirichlet boundary condition on a part of the…
We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…
The aim of this paper is to give a precise asymptotic description of some eigenvalue statistics stemming from random matrix theory. More precisely, we consider random determinants of the GUE, Laguerre, Uniform Gram and Jacobi beta ensembles…
Let $G = (V, E)$ be a graph. We define matrices $M(G; \alpha, \beta)$as $\alpha D + \beta A$, where $\alpha$, $\beta$ are real numbers such that $(\alpha, \beta) \neq (0, 0)$ and $D$ and $A$ are the diagonal matrix and adjacency matrix of…