相关论文: Orthonormal Eigenbases over the Octonions

Improving upon results of Rudelson and Vershynin, we establish delocalization bounds for eigenvectors of independent-entry random matrices. In particular, we show that with high probability every eigenvector is delocalized, meaning any…

I investigate on the number t of real eigenvectors of a real symmetric tensor. In particular, given a homogeneous polynomial f of degree d in 3 variables, i prove that t is greater or equal than 2c+1, if d is odd and t is greater or equal…

Most algorithms constructing bases of finite-dimensional vector spaces return basis vectors which, apart from orthogonality, do not show any special properties. While every basis is sufficient to define the vector space, not all bases are…

Decomposing tensors into orthogonal factors is a well-known task in statistics, machine learning, and signal processing. We study orthogonal outer product decompositions where the factors in the summands in the decomposition are required to…

Let $A=[a_{ij}]\in O_3(\mathbb{R})$. We give several different proofs of the fact that the vector $$ V:=\left[\begin{array}{ccc} \displaystyle \frac{1}{a_{23}+a_{32}} & \displaystyle \frac{1}{a_{13}+a_{31}} & \displaystyle…

We introduce the triangulant of two matrices, and relate it to the existence of orthogonal eigenvectors. We also use it for a new characterization of mutually unbiased bases. Generalizing the notion, we introduce higher order triangulants…

We characterise graphs that have three distinct eigenvalues and coherent ranks 8 and 9, linking the former to certain symmetric 2-designs and the latter to specific quasi-symmetric 2-designs. This characterisation leads to the discovery of…

The exponential of an NxN matrix can always be expressed as a matrix polynomial of order N-1. In particular, a general group element for the fundamental representation of SU(N) can be expressed as a matrix polynomial of order N-1 in a…

The symmetric group on 4 letters has the reflection group $D_{3}$ as an isomorphic image. This fact follows from the coincidence of the root systems $A_{3}$ and $D_{3}$. The isomorphism is used to construct an orthogonal basis of…

We construct ensembles of random integrable matrices with any prescribed number of nontrivial integrals and formulate integrable matrix theory (IMT) -- a counterpart of random matrix theory (RMT) for quantum integrable models. A type-M…

Factorization method is developed for a family of discretely spiked harmonic oscillators. Two sets of intertwining and ladder operators are presented to algebraically generate eigenstates with energies isomorphic to those of the ordinary…

Extending the method of the paper [FS3] we prove three structure theorems for vector valued modular forms, where two correspond to 4-dimensional cases (two hermitian modular groups, one belonging to the field of Eisenstein numbers, the…

In this text, based on elementary computations, we provide a perturbative expansion of the coordinates of the eigenvectors of a Hermitian matrix of large size perturbed by a random matrix with small operator norm whose entries in the…

Let M be an arbitrary Hermitian matrix of order n, and k be a positive integer less than or equal to n. We show that if k is large, the distribution of eigenvalues on the real line is almost the same for almost all principal submatrices of…

A simple approximate relationship between the ground-state eigenvector and the sum of matrix elements in each row has been established for real symmetric matrices with non-positive off-diagonal elements. Specifically, the $i$-th components…

We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…

The canonical quantum Hamiltonian eigenvalue problem for an anharmonic oscillator with a Lagrangian L = \dot{\phi}^2/2 - m^2 \phi^2/2 - g m^3 \phi^4 is numerically solved in two ways. One of the ways uses a plain cutoff on the number of…

Classical random matrix ensembles with orthogonal symmetry have the property that the joint distribution of every second eigenvalue is equal to that of a classical random matrix ensemble with symplectic symmetry. These results are shown to…

The eigenpair here means the twins consist of eigenvalue and its eigenvector. This paper introduces the three steps of our study on computing the maximal eigenpair. In the first two steps, we construct efficient initials for a known but…

We generally study the density of eigenvalues in unitary ensembles of random matrices from the recurrence coefficients with regularly varying conditions for the orthogonal polynomials. First we calculate directly the moments of the density.…