Related papers: The real polynomial eigenvalue problem is well con…

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…

This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…

We present the results of systematic numerical computations relating to the extreme value statistics of the characteristic polynomials of random unitary matrices drawn from the Circular Unitary Ensemble (CUE) of Random Matrix Theory. In…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

Gaussian mixture models (GMMs) are ubiquitous in statistical learning, particularly for unsupervised problems. While full GMMs suffer from the overparameterization of their covariance matrices in high-dimensional spaces, spherical GMMs…

We consider those Gaussian Unitary Ensembles where the eigenvalues have prescribed multiplicities, and obtain joint probability density for the eigenvalues. In the simplest case where there is only one multiple eigenvalue t, this leads to…

We consider matrix-valued processes described as solutions to stochastic differential equations of very general form. We study the family of the empirical measure-valued processes constructed from the corresponding eigenvalues. We show that…

We investigate the maximal size of distinguished submatrices of a Gaussian random matrix. Of interest are submatrices whose entries have average greater than or equal to a positive constant, and submatrices whose entries are well-fit by a…

In this work, we discuss some properties of the eigenvalues of some classes of signed complete graphs. We also obtain the form of characteristic polynomial for these graphs.

We consider a sequence of polynomials $\{P_n\}_{n \geq 0}$ satisfying a special $R_{II}$ type recurrence relation where the zeros of $P_n$ are simple and lie on the real line. It turns out that the polynomial $P_n$, for any $n \geq 2$, is…

We develop a theoretical approach to compute the conditioned spectral density of $N \times N$ non-invariant random matrices in the limit $N \rightarrow \infty$. This large deviation observable, defined as the eigenvalue distribution…

In this note we prove that certain polynomial mappings $P_\mathfrak{g}^k(\mathbf{x}) \in \mathbf{Z}[\mathbf{x}]$ in $n$-variables obtained from simple complex Lie algebras $\mathfrak{g}$ of arbitrary rank $n \ge 1$, are exceptional.

In this paper, we review the eigenpair problem in the context of tropical algebra. An important fact that has been largely overlooked in spectral theory of tropical algebra is that the tropical algebraic eigenvalues, which are obtained from…

Sensitivity of an eigenvalue $\lambda_i$ to the perturbation of matrix elements is controlled by the eigenvalue condition number defined as $\kappa_i = \sqrt{\left< L_i | L_i\right> \left< R_i|R_i \right> }$, where $\left<L_i\right|$ and…

We study multiple orthogonal polynomials of type I and type II which have orthogonality conditions with respect to r measures. These polynomials are connected by their recurrence relation of order r+1. First we show a relation with the…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

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.

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

We present a novel approach to study eigenvalues of deformed random matrices. This approach applies to many deformed Gaussian matrix models; two such models are studied in detail: the deformed GOE and the spiked population model.