Related papers: On the Eigenvectors of Generalized Circulant Matri…
This paper describes the expected characteristic polynomial of the commutator of randomly rotated matrices, in the context of the finite free probability theory initiated by Marcus, Spielman, and Srivastava. The key technical features are…
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
We calculate eigenvector statistics in an ensemble of non-Hermitian matrices describing open quantum systems [F. Haake et al., Z. Phys. B 88, 359 (1992)] in the limit of large matrix size. We show that ensemble-averaged eigenvector…
Consider Ginibre's ensemble of $N \times N$ non-Hermitian random matrices in which all entries are independent complex Gaussians of mean zero and variance $\frac{1}{N}$. As $N \uparrow \infty$ the normalized counting measure of the…
The paper explains how a unit generalized quaternion is used to represent a rotation of a vector in 3-dimensional space. We review of some algebraic properties of generalized quaternions and operations between them and then show their…
Due to their rich algebraic structures and various applications, circulant matrices have been of interest and continuously studied. In this paper, the notions of Binomial-related matrices have been introduced. Such matrices are circulant…
In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at random according to the Ewens measure of parameter $\theta>0$) by replacing the entries equal to one by…
We show that correlation matrices with particular average and variance of the correlation coefficients have a notably restricted spectral structure. Applying geometric methods, we derive lower bounds for the largest eigenvalue and the…
Whereas the tools to determine the eigenvalues of the eight-vertex transfer matrix T are well known there has been until recently incomplete knowledge about the eigenvectors of T. We describe the construction of eigenvectors of T…
We provide necessary and sufficient conditions on the existence of common hypercyclic vectors for multiples of the backward shift operator along sparse powers. Our main result strongly generalizes corresponding results which concern the…
In this paper we determine a closed formula for the number of convex permutominoes of size n. We reach this goal by providing a recursive generation of all convex permutominoes of size n+1 from the objects of size n, according to the ECO…
Generalized inverses of tensors play increasingly important roles in computational mathematics and numerical analysis. It is appropriate to develop the theory of generalized inverses of tensors within the algebraic structure of a ring. In…
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…
We present a matrix version of a known method of constructing common eigenvectors of two diagonalizable commuting matrices, thus enabling their simultaneous diagonalization. The matrices may have simple eigenvalues of multiplicity greater…
We study the generalized roundness of finite metric spaces whose distance matrix $D$ has the property that every row of $D$ is a permutation of the first row. The analysis provides a way to characterize subsets of the Hamming cube $\{ 0, 1…
Generalized matrix Lotka-Volterra lattice equations are obtained in a systematic way from a "master equation" possessing a bicomplex formulation.
We present identities for permutations with fixed points. The formulas are based on successive derivations or integrations of the determinant of a particular matrix.
We consider open XXX spins chain with two general boundary matrices submitted to one constraint, which is equivalent to the possibility to put the two matrices in a triangular form. We construct Bethe vectors from a generalized algebraic…
Eigenvalue and eigenpair backward errors are computed for matrix pencils arising in optimal control. In particular, formulas for backward errors are developed that are obtained under block-structure-preserving and…
An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…