Related papers: Eigenvector of a matrix in $SO_3(\mathbb{R})$

We investigate eigenvectors of rank-one deformations of random matrices $\boldsymbol B = \boldsymbol A + \theta \boldsymbol {uu}^*$ in which $\boldsymbol A \in \mathbb R^{N \times N}$ is a Wigner real symmetric random matrix, $\theta \in…

We consider random matrices of the form $H = W + \lambda V$, $\lambda\in\mathbb{R}^+$, where $W$ is a real symmetric or complex Hermitian Wigner matrix of size $N$ and $V$ is a real bounded diagonal random matrix of size $N$ with i.i.d.\…

For a finite dimensional unital complex simple Jordan superalgebra $J$, the Tits-Kantor-Koecher construction yields a 3-graded Lie superalgebra $\mathfrak g_\flat\cong \mathfrak g_\flat(-1)\oplus\mathfrak g_\flat(0)\oplus\mathfrak…

In this paper, we introduce symmetric diagram matrices $A_{s+r,s}$ of size ${_{(s+r)}}C_s$ whose entries are $\{x_i\}_{min\{s,r\}}$. We compute the eigenvalues of symmetric diagram matrices using elementary row and column operations…

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…

Hu and Ye conjectured that for a $k$-th order and $n$-dimensional tensor $\mathcal{A}$ with an eigenvalue $\lambda$ and the corresponding eigenvariety $\mathcal{V}_\lambda(\mathcal{A})$, $$\mathrm{am}(\lambda) \ge \sum_{i=1}^\kappa…

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…

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…

The leading eigenpair (the couple of eigenvalue and its eigenvector) or the first nontrivial one has different names in different contexts. It is the maximal one in the matrix theory. The talk starts from our new results on computing the…

An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. It is well known that a graph $G$ has exactly two main eigenvalues if and only if there exists a unique pair of…

We discuss the eigenvalue problem for 2x2 and 3x3 octonionic Hermitian matrices. In both cases, we give the general solution for real eigenvalues, and we show there are also solutions with non-real eigenvalues.

Consider a data matrix $Y = [\mathbf{y}_1, \cdots, \mathbf{y}_N]$ of size $M \times N$, where the columns are independent observations from a random vector $\mathbf{y}$ with zero mean and population covariance $\Sigma$. Let $\mathbf{u}_i$…

In this note we present a parameterized class of lower triangular matrices. The components of the eigenvectors grow rapidly and will exceed the representational range of any finite number system. The eigenvalues and the eigenvectors are…

We consider the eigenvalues and eigenvectors of an axisymmetric matrix$A$ with some special structures. We propose S-Oja-Brockett equation $\frac{dX}{dt}=AXB-XBX^TSAX,$ where $X(t) \in {\mathbb R}^{n \times m}$ with $m \leq n$, $S$ is a…

Let A be a k-vector space of dimension a. A subvector space M of End(A) is said to be of rank r if every non-zero f in M has rank r. The problem considered in this paper is to determine l(r;a) the maximal dimension of a rank r subspace of…

If a nonnegative selfadjoint linear relation $A$ in a Hilbert space and a closed subspace $\mathcal{S}$ are assumed to satisfy that the domain of $A$ is invariant under the orthogonal projector onto $\mathcal{S},$ then $A$ admits a…

The Hadwiger number of a graph $G$, denoted by $h(G)$, is the order of the largest complete minor of $G$. A graph is said to be self-complementary if it is isomorphic to its complement. We prove that for all $n\equiv 0,1 (\text{mod 4})$ and…

The eigenvector-eigenvalue identity relates the eigenvectors of a Hermitian matrix to its eigenvalues and the eigenvalues of its principal submatrices in which the jth row and column have been removed. We show that one-dimensional arrays of…

Let A be an n x n symmetric random matrix whose upper-triangular entries are independent and follow possibly non-identical subgaussian distributions. This paper investigates the spectral properties of A, including its eigenvalues and…

We consider the problem of estimating the spectrum of a symmetric bounded entry (not necessarily PSD) matrix via entrywise sampling. This problem was introduced by [Bhattacharjee, Dexter, Drineas, Musco, Ray '22], where it was shown that…