Related papers: Eigenvector in Non-Commutative Algebra

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…

Peter Denton, Stephen Parke, Terence Tao and Xining Zhang [arxiv 2019] presented a basic and important identity in linear commutative algebra, so-called {\bf the eigenvector-eigenvalue identity} (formally named in [BAMS, 2021]), which is a…

Let $k$ be a field and $n,a,b$ natural numbers. A matrix pencil $P$ is given by $n$ matrices of the same size with coefficients in $k$, say by $(b\times a)$-matrices, or, equivalently, by $n$ linear transformations $\alpha_i\:k^a \to k^b$…

Consider vector space over non-commutative division algebra. Set of automorphisms of this vector space is group $GL$. Group $GL$ acts on the set of bases of vector space (basis manifold) single transitive and generates active…

The nonzero eigenvalues of $AB$ are equal to those of $BA$: an identity that holds as long as the products are square, even when $A,B$ are rectangular. This fact naturally suggests an efficient algorithm for computing eigenvalues and…

If $A$ is an $n \times n$ Hermitian matrix with eigenvalues $\lambda_1(A),\dots,\lambda_n(A)$ and $i,j = 1,\dots,n$, then the $j^{\mathrm{th}}$ component $v_{i,j}$ of a unit eigenvector $v_i$ associated to the eigenvalue $\lambda_i(A)$ is…

Let $k$ be an algebraically closed field of characteristic 0, and let $V$ be a finite-dimensional vector space. Let $End(V)$ be the semigroup of all polynomial endomorphisms of $V$. Let $E$ be a subset of $End(V)$ which is a linear subspace…

Over the past decades, transformations between different classes of eigenvalue problems have played a central role in the development of numerical methods for eigenvalue computations. One of the most well-known and successful examples of…

A non-zero component graph $G(\mathbb{V})$ associated to a finite vector space $\mathbb{V}$ is a graph whose vertices are non-zero vectors of $\mathbb{V}$ and two vertices are adjacent, if their corresponding vectors have at least one…

The Kalman variety of a linear subspace in a vector space consists of all endomorphism that possess an eigenvector in that subspace. We study the defining polynomials and basic geometric invariants of the Kalman variety.

We consider square matrices over $\mathbb{C}$ satisfying an identity relating their eigenvalues and the corresponding eigenvectors re-proved and discussed by Denton, Parker, Tao and Zhang, called the eigenvector-eigenvalue identity. We…

A vector space is commonly defined as a set that satisfies several conditions related to addition and scalar multiplication. However, for beginners, it may be hard to immediately grasp the essence of these conditions. There are probably a…

An invertible matrix is called a Perron similarity if one of its columns and the corresponding row of its inverse are both nonnegative or both nonpositive. Such matrices are of relevance and import in the study of the nonnegative inverse…

Diagonalizing a matrix $A$, that is finding two matrices $P$ and $D$ such that $A = PDP^{-1}$ with $D$ being a diagonal matrix needs two steps: first find the eigenvalues and then find the corresponding eigenvectors. We show that we do not…

Graph Isomorphism is one of the classical problems of graph theory for which no deterministic polynomial-time algorithm is currently known, but has been neither proven to be NP-complete. Several heuristic algorithms have been proposed to…

A square matrix is called stochastic (or row-stochastic) if it is non-negative and has each row sum equal to unity. Here, we constitute an eigenvalue localization theorem for a stochastic matrix, by using its principal submatrices. As an…

Let $V$ be a finite-dimensional vector space over the field with $p$ elements, where $p$ is a prime number. Given arbitrary $\alpha,\beta\in \mathrm{GL}(V)$, we consider the semidirect products $V\rtimes\langle \alpha\rangle$ and…

Let $A_1=K < X, Y | [Y,X]=1>$ be the (first) Weyl algebra over a field $K$ of characteristic zero. It is known that the set of eigenvalues of the inner derivation $\ad (YX)$ of $A_1$ is $\Z$. Let $ A_1\ra A_1$, $X\mapsto x$, $Y\mapsto y$,…

The eigenvalues of the transfer matrix in a six-vertex model (with periodic boundary conditions) can be written in terms of n constants v1,...,vn, the zeros of the function Q(v). A peculiar class of eigenvalues are those in which two of the…

Let $V$ be a finite-dimensional vector space over a field $\mathbb{F}$, equipped with a symmetric or alternating non-degenerate bilinear form $b$. When the characteristic of $\mathbb{F}$ is not $2$, we characterize the endomorphisms $u$ of…