相关论文: The eigenvectors of the right-justified Pascal tri…

We consider a square random matrix of size $N$ of the form $P(Y,A)$ where $P$ is a noncommutative polynomial, $A$ is a tuple of deterministic matrices converging in $\ast$-distribution, when $N$ goes to infinity, towards a tuple $a$ in some…

The class of three-diagonal Jacobi matrix with exponentially increasing elements is considered. Under some assumptions the matrix corresponds to unbounded self-adjoint operator in the weighted space. The weight depends on elements of the…

A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^TAP$ for some permutation matrix P. The problem of characterizing such…

We consider the eigenvalues and eigenvectors of matrices of the form M + P, where M is an n by n Wigner random matrix and P is an arbitrary n by n deterministic matrix with low rank. In general, we show that none of the eigenvalues of M + P…

The paper develops the general theory for the items in the title, assuming that the matrix is countable and cofinal.

Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…

We prove a conjecture by Van Dam and Sotirov on the smallest eigenvalue of (distance-$j$) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-$j$) Johnson graphs. More generally, we study the smallest…

Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the…

We propose an efficient algorithm for computing a common eigenvector of a finite set of square matrices. As an immediate consequence we obtain an algorithm for determining whether the matrices admit a simultaneous triangulation, and, if so,…

Denton, Parke, Tao and Zhang gave a new method which determines eigenvectors from eigenvalues for Hermitian matrices with distinct eigenvalues. In this short note, we extend the above result to general Hermitian matrices.

We study projective schemes arising from eigenvectors of tensors, called eigenschemes. After some general results, we give a birational description of the variety parametrizing eigenschemes of general ternary symmetric tensors and we…

It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…

We show that the number of acyclic directed graphs with n labeled vertices is equal to the number of n X n (0,1)-matrices whose eigenvalues are positive real numbers.

The study of solving the inverse eigenvalue problem for nonnegative matrices has been around for decades. It is clear that an inverse eigenvalue problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…

We make two observations regarding the invertibility of Keller maps. i.e., polynomial maps for which the determinant of their Jacobian matrix is identically equal to 1. In our first result, we show that if P is a n-dimensional Keller map,…

In this paper, we give a proof of a conjecture made by Zagier about the inverse of some matrix related to double zeta values of parity $(\mathrm{even},\mathrm{odd})$. As a result, we obtain a family of Bernoulli number identities. We…

We study statistical properties of the eigenvectors of non-Hermitian random matrices, concentrating on Ginibre's complex Gaussian ensemble, in which the real and imaginary parts of each element of an N x N matrix, J, are independent random…

We describe an ensemble of (sparse) random matrices whose eigenvalues follow the Gibbs distribution for n particles of the Coulomb gas on the unit circle at inverse temperature beta. Our approach combines elements from the theory of…

We study the Laplacian of the undirected De Bruijn graph over an alphabet $A$ of order $k$. While the eigenvalues of this Laplacian were found in 1998 by Delorme and Tillich [1], an explicit description of its eigenvectors has remained…

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…