Related papers: On the eigenvalue region of permutative doubly sto…
The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…
Consider an $n \times p$ data matrix $X$ whose rows are independently sampled from a population with covariance $\Sigma$. When $n,p$ are both large, the eigenvalues of the sample covariance matrix are substantially different from those of…
Modeling matrix-valued time series is an interesting and important research topic. In this paper, we extend the method of Chang et al. (2017) to matrix-valued time series. For any given $p\times q$ matrix-valued time series, we look for…
We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
In this paper, we study the problems of detection and recovery of hidden submatrices with elevated means inside a large Gaussian random matrix. We consider two different structures for the planted submatrices. In the first model, the…
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…
Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…
We characterise regions in the complex plane that contain all non-embedded eigenvalues of a perturbed periodic Dirac operator on the real line with real-valued periodic potential and a generally non-symmetric matrix-valued perturbation V .…
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…
This paper investigates limiting properties of eigenvalues of multivariate sample spatial-sign covariance matrices when both the number of variables and the sample size grow to infinity. The underlying p-variate populations are general…
An $n \times m$ non-negative matrix with row sum $m$ and column sum $n$ is called doubly stochastic. We answer the problem of finding doubly stochastic matrices of smallest posible support for every $1 <n \leq m$. Any matrix of minimum…
Characterizing simultaneously diagonalizable (SD) matrices has been receiving considerable attention in the recent decades due to its wide applications and its role in matrix analysis. However, the notion of SD matrices is arguably still…
We study the row-space partition and the pivot partition on the matrix space $\mathbb{F}_q^{n \times m}$. We show that both these partitions are reflexive and that the row-space partition is self-dual. Moreover, using various combinatorial…
Experiments suggest that typical finite sets of square matrices admit spectrum maximizing products (SMPs): that is, products that attain the joint spectral radius (JSR). Furthermore, those SMPs are often combinatorially "simple." In this…
For each square matrix polynomial $P(\lambda)$ of odd degree, a block-symmetric block-tridiagonal pencil $\mathcal{T}_{P}(\lambda)$ was introduced by Antoniou and Vologiannidis in 2004, and a variation $\mathcal{R}_P(\lambda)$ was…
In many applied problems one seeks to identify and count the critical points of a particular eigenvalue of a smooth parametric family of self-adjoint matrices, with the parameter space often being known and simple, such as a torus. Among…
For the eigenvalues of $p$ complex hermitian $n\times n$ matrices coupled in a chain, we give a method of calculating the spacing functions. This is a generalization of the one matrix case which has been known for a long time.
This paper presents a deterministic, strongly polynomial time algorithm for computing the matrix rank for a class of symbolic matrices (whose entries are polynomials over a field). This class was introduced, in a different language, by…
We consider Steklov eigenvalues of nearly hyperspherical domains in $\mathbb{R}^{d + 1}$ with $d\ge 3$. In previous work, treating such domains as perturbations of the ball, we proved that the Steklov eigenvalues are analytic functions of…