Related papers: Spectra of Tridiagonal Matrices over a Field

We provide a detailed description of the maps associated with spectral interlacing, for rank one perturbations and bordering of symmetric and Hermitian matrices. The arguments rely on standard techniques of nonlinear analysis.

Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix…

We formulate a general sufficiency criterion for discreteness of the spectrum of both supersymmmetric and non-su-persymmetric theories with a fermionic contribution. This criterion allows an analysis of Hamiltonians in complete form rather…

We introduce a non-Hermitian $\beta$-ensemble and determine its spectral density in the limit of large $\beta$ and large matrix size $n$. The ensemble is given by a general tridiagonal complex random matrix of normal and chi-distributed…

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…

Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A and B be upper triangular n-by-n matrices that (i) are not similar to direct sums of matrices of smaller…

Let $A$ be a matrix of size $n \times n$ over an algebraically closed field $F$ and $q(t)$ a monic polynomial of degree $n$. In this article, we describe the necessary and sufficient conditions of $q(t)$ so that there exists a rank one…

Let $n\ge 2$ be an integer. Let $R_n$ denote the $n\times n$ tridiagonal matrix with $-1$'s on the sub-diagonal, $1$'s on the super-diagonal, $-1$ in the $(1,1)$ entry, $1$ in the $(n,n)$ entry and zeros elsewhere. We find the eigen-pairs…

The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…

We prove that, over a field of characteristic $0$, the degrees of factors of a binomial $t^n-\alpha$ are divisible by the least such degree. As a consequence, we deduce that for relatively prime natural numbers $m,n$, a polynomial has the…

Sparse non-Hermitian random matrices arise in the study of disordered physical systems with asymmetric local interactions, and have applications ranging from neural networks to ecosystem dynamics. The spectral characteristics of these…

Subsets of a matrix algebra over a field that are invariant under conjugation and contain the linear span of each two of their commuting elements are described. They obviously include the subsets of diagonalizable and nilpotent matrices. In…

We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…

We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. Our result is…

This paper investigates finite-dimensional representations of PT-symmetric Hamiltonians. In doing so, it clarifies some of the claims made in earlier papers on PT-symmetric quantum mechanics. In particular, it is shown here that there are…

A tournament is $k$-spectrally monomorphic if all the $k\times k$ principal submatrices of its adjacency matrix have the same characteristic polynomial. Transitive $n$-tournaments are trivially $k$-spectrally monomorphic. We show that there…

We study Jacobi matrices on trees whose coefficients are generated by multiple orthogonal polynomials. Hilbert space decomposition into an orthogonal sum of cyclic subspaces is obtained. For each subspace, we find generators and the…

The energy spectra of two different quantum systems are paired through supersymmetric algorithms. One of the systems is Hermitian and the other is characterized by a complex-valued potential, both of them with only real eigenvalues in their…

Gaussian and Chiral Beta-Ensembles, which generalise well known orthogonal (Beta=1), unitary (Beta=2), and symplectic (Beta=4) ensembles of random Hermitian matrices, are considered. Averages are shown to satisfy duality relations like…

A list $\Lambda =\{\lambda _{1},\ldots ,\lambda _{n}\}$ of complex numbers (repeats allowed) is said to be \textit{realizable} if it is the spectrum of an entrywise nonnegative matrix $A$. $\Lambda $ is \textit{diagonalizably realizable} if…