Related papers: A new proof of an equality associated with submatr…

We investigate the evolution of a given eigenvector of a symmetric (deterministic or random) matrix under the addition of a matrix in the Gaussian orthogonal ensemble. We quantify the overlap between this single vector with the eigenvectors…

We give elementary proofs of two theorems concerning bounds on the maximum argument of the eigenvalues of a product of two unitary matrices --- one by Childs \emph{et al.} [J. Mod. Phys., \textbf{47}, 155 (2000)] and the other one by Chau…

We give a new proof for an equality of certain max-min and min-max approximation problems involving normal matrices. The previously published proofs of this equality apply tools from matrix theory, (analytic) optimization theory and…

Using our recent results on eigenvalues of invariants associated to the Lie superalgebra gl(m|n), we use characteristic identities to derive explicit matrix element formulae for all gl(m|n) generators, particularly non-elementary…

The paper presents methods of eigenvalue localisation of regular matrix polynomials, in particular, stability of matrix polynomials is investigated. For this aim a stronger notion of hyperstability is introduced and widely discussed. Matrix…

In this paper, we use a new approach to prove that the largest eigenvalue of the sample covariance matrix of a normally distributed vector is bigger than the true largest eigenvalue with probability 1 when the dimension is infinite. We…

A remarkable mathematical property -- somehow hidden and recently rediscovered -- allows obtaining the eigenvectors of a Hermitian matrix directly from their eigenvalues. That opens the possibility to get the wavefunctions from the…

This paper deals with adjacency matrices of signed cycle graphs and chemical descriptors based on them. The eigenvalues and eigenvectors of the matrices are calculated and their efficacy in classifying different signed cycles is determined.…

The aim of this paper is to prove an improved version of the bounded differences inequality for matrix valued functions, by developing the methods of Mackey et al.: "Matrix Concentration Inequalities via the Method of Exchangeable Pairs".…

We propose and analyze a finite element method for the Oseen eigenvalue problem. This problem is an extension of the Stokes eigenvalue problem, where the presence of the convective term leads to a non-symmetric problem and hence, to complex…

In this paper we give a small review of some recent results of elementary equivalence of linear and algebraic groups and our last new results of elementary equivalence of categories of modules, endomorphism rings of modules, lattices of…

We define a q-analog of the adjacency matrix of the n-cube, determine its eigenvalues and write down a canonical eigenbasis. We give a weighted count of the number of rooted spanning trees in the q-analog of the n-cube. Remarks on the…

The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…

We revisit the landmark paper [D. S. Mackey, N. Mackey, C. Mehl, and V. Mehrmann, SIAM J. Matrix Anal. Appl., 28 (2006), pp.~971--1004] and, by viewing matrices as coefficients for bivariate polynomials, we provide concise proofs for key…

The max-plus algebra $\mathbb{R}\cup \{-\infty \}$ is a semiring with the two operations: addition $a \oplus b := \max(a,b)$ and multiplication $a \otimes b := a + b$. Roots of the characteristic polynomial of a max-plus matrix are called…

We present unified approach to different recent entanglement criteria. Although they were developed in different ways, we show that they are all applications of a more general principle given by the Cauchy-Schwarz inequality. We explain…

We solve a combinatorial question concerning eigenvalues of the universal intertwining endomorphism of a subset representation. This is then applied to justify the evaluation of the Eisenbud-Levine-Khimshiashvili (ELK) signature formula for…

We consider $N\times N$ Hermitian or symmetric random matrices with independent entries. The distribution of the $(i,j)$-th matrix element is given by a probability measure $\nu_{ij}$ whose first two moments coincide with those of the…

Computing the eigenvectors and eigenvalues of a perturbed matrix can be remarkably difficult when the unperturbed matrix has repeated eigenvalues. In this work we show how the limiting eigenvectors and eigenvalues of a symmetric matrix…

This is a remark on a recent post by P. Denton, S. Parke, T. Tao, X. Zhang, Eigenvectors from eigenvalues, arXiv:1908.03795v1