Related papers: Eigenvalue location of certain matrix polynomials

The circular and Jacobi ensembles of random matrices have their eigenvalue support on the unit circle of the complex plane and the interval $(0,1)$ of the real line respectively. The averaged value of the modulus of the corresponding…

Twin vertices of a graph have the same open neighbourhood. If they are not adjacent, then they are called duplicates and contribute the eigenvalue zero to the adjacency matrix. Otherwise they are termed co-duplicates, when they contribute…

We study Hermitian random matrix models with an external source matrix which has equispaced eigenvalues, and with an external field such that the limiting mean density of eigenvalues is supported on a single interval as the dimension tends…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…

In the article, we study variational eigenvalues on doubling metric measure spaces. We prove existence of minimizers of variational Neumann $(p,q)$-eigenvalues on metric measure spaces and on this base we obtain estimates of Neumann…

In this work we present a framework for studying the eigenvalues of a family of matrices with a particular displacement structure. The family admits a specific decomposition as the product of an upper and a lower triangular matrices having…

Using the results on the $1/n$-expansion of the Verblunsky coefficients for a class of polynomials orthogonal on the unit circle with $n$ varying weight, we prove that the local eigenvalue statistic for unitary matrix models is independent…

We study the average condition number for polynomial eigenvalues of collections of matrices drawn from various random matrix ensembles. In particular, we prove that polynomial eigenvalue problems defined by matrices with Gaussian entries…

The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…

Let $K$ be a valued field (in general $K$ is not heselian) with valuation $v$ and $A(x)\in K[x]$ be a polynomial of degree $n$. We find necessary and sufficient conditions for the existence of the elements $s,t,u\in K$, $s\neq 0\neq u$,…

When an eigenvector of a semi-bounded operator is positive, we show that a remarkably simple argument allows to obtain upper and lower bounds for its associated eigenvalue. This theorem is a substantial generalization of Barta-like…

We study the universality of the eigenvalue statistics of the covariance matrices $\frac{1}{n}M^* M$ where $M$ is a large $p\times n$ matrix obeying condition $\bf{C1}$. In particular, as an application, we prove a variant of universality…

We discuss some extensions and refinements of the variance bounds for both real and complex numbers. The related bounds for the eigenvalues and spread of a matrix are also derived here.

We consider random matrix ensembles on the set of Hermitian matrices that are heavy tailed, in particular not all moments exist, and that are invariant under the conjugate action of the unitary group. The latter property entails that the…

The stated paper is dedicated to one of the inverse problems of spectral theory. It is necessary to define matrix (constant) coefficients of some quadratic pencil, if the eigenvalues of this pencil are known. Furthermore, it is known that…

Assume that the coefficients of a polynomial in a complex variable are Laurent polynomials in some complex parameters. The parameter space (a complex torus) splits into strata corresponding to different combinations of coincidence of the…

In this paper, we study some properties of associated sequaences in umbral calculus. From these properties, we derive new and interesting identities of several kinds of polynomials.

The product matrix of a finite commutative ring $R=\{x_1,x_2,\ldots,x_n\}$ and an element $u \in R$ is the matrix $A_u(R)=[a_{ij}]$, where $a_{ij}=1$ if $x_ix_j=u$, and $a_{ij}=0$ otherwise. This provides a natural extension of the concept…

The boundary of a numerical range of a finite matrix is always a nice curve (algebraic, closed and simple), but the equation it satisfies is often very complicated. We will show that, furthermore, there is no hope of describing these curves…