Related papers: Leveraging the Cayley Hamilton Theorem for Efficie…
Let k be an algebraically closed field of characteristic p \ge 0. We shall consider the problem of finding out a Jordan canonical form of J(\alpha,s) \otimes_{k} J(\beta,t), where J(\alpha,s) means the Jordan block with eigenvalue \alpha…
Let E be an elementary abelian p-group of rank r and let k be a field of characteristic p. We introduce functors F_i from finitely generated kE-modules of constant Jordan type to vector bundles over projective space of dimension r-1. The…
It is a well-known fact that the first and last non-trivial coefficients of the characteristic polynomial of a linear operator are respectively its trace and its determinant. This work shows how to compute recursively all the coefficients…
Starting from the expression for the superdeterminant of (xI-M), where M is an arbitrary supermatrix, we propose a definition for the corresponding characteristic polynomial and we prove that each supermatrix satisfies its characteristic…
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.
We construct a Jordan curve $\Gamma \subset \mathbb{C}$ so that for any rectifiable arc $\sigma$ with endpoints in distinct complementary components of $\Gamma$, $H^1(\sigma \cap \Gamma) > 0$.
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
Although the linear method is one of the most robust algorithms for optimizing non-linearly parametrized wavefunctions in variational Monte Carlo, it suffers from a memory bottleneck due to the fact at each optimization step a generalized…
A variational method is presented for directly finding the bifurcation point of nonlinear equations as the saddle-node point of the extended nonlinear Rayleigh quotient. The method is applied for solving an open problem on the existence of…
Finding a good approximation of the top eigenvector of a given $d\times d$ matrix $A$ is a basic and important computational problem, with many applications. We give two different quantum algorithms that, given query access to the entries…
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…
We establish a sharp upper estimate for the order of a canonical system in terms of the Hamiltonian. This upper estimate becomes an equality in the case of Krein strings. As an application we prove a conjecture of Valent about the order of…
The solutions of an indeterminate Hamburger moment problem can be parameterised using the Nevanlinna matrix of the problem. The entries of this matrix are entire functions of minimal exponential type, and any growth less than that can…
We compute the leading order asymptotic of the maximum of the characteristic polynomial for i.i.d. matrices with real or complex entries. In particular, this result is new even for real Ginibre matrices, which was left as an open problem in…
A Lyapunov matrix equation can be converted, by using the Jordan decomposition theorem for matrices, into an equivalent Lyapunov matrix equation where the matrix is a Jordan matrix. The Lyapunov matrix equation with Jordan matrix can be…
A century ago, Camille Jordan proved that the complex general linear group $GL_n(C)$ has the Jordan property: there is a Jordan constant $C_n$ such that every finite subgroup $H \le GL_n(C)$ has an abelian subgroup $H_1$ of index $[H : H_1]…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
We completely characterize the higher rank numerical range of the matrices of the form $J_n(\alpha)\oplus\beta I_m$, where $J_n(\alpha)$ is the $n\times n$ Jordan block with eigenvalue $\alpha$. Our characterization allows us to obtain…
We explore Jordan derivations of triangular matrices with entries from an additively idempotent semiring. The main result states that for any matrix A over additively idempotent semiring, if we put all the elements of the family of dense…
Let $P$ be a preordered set, $R$ a ring and $FI(P,R)$ the finitary incidence ring of $P$ over $R$. We find a criterion for all Jordan derivations of $FI(P,R)$ to be derivations and generalize Theorem 3.3 from arXiv:1411.6123. In particular,…