Related papers: Leveraging the Cayley Hamilton Theorem for Efficie…
A bootstrap program is presented for algebraically solving the $R$-matrix of a generic integrable quantum spin chain from its Hamiltonian. The Yang-Baxter equation contains an infinite number of seemingly independent constraints on the…
Let X be a smooth variety and Y a closed subscheme of X. By comparing motivic integrals on X and on a log resolution of (X,Y), we prove the following formula for the log canonical threshold of (X,Y): c(X,Y)=dim X-sup_m{(dim Y_m}/(m+1)},…
We propose two ways for determining the Green's matrix for problems admitting Hamiltonians that have infinite symmetric tridiagonal (i.e. Jacobi) matrix form on some basis representation. In addition to the recurrence relation comming from…
A problem of practical and theoretical interest is to determine or estimate the diameter of various families of Cayley networks. The previously known estimate for the diameter of Cayley graphs generated by transposition trees is an upper…
This paper initiates the study of quantum algorithms for matroid property problems. It is shown that quadratic quantum speedup is possible for the calculation problem of finding the girth or the number of circuits (bases, flats,…
The general solution to the reflection equation associated with the jordanian deformation of the SL(2) invariant Yang R-matrix is found. The same K-matrix is obtained by the special scaling limit of the XXZ-model with general boundary…
The set of n by n upper-triangular nilpotent matrices with entries in a finite field F_q has Jordan canonical forms indexed by partitions lambda of n. We present a combinatorial formula for computing the number F_\lambda(q) of matrices of…
The algebraic method enables one to study the properties of the spectrum of a quadratic Hamiltonian through the mathematical properties of a matrix representation called regular or adjoint. This matrix exhibits exceptional points where it…
The product of a matrix chain consisting of $n$ matrices can be computed in $C_{n-1}$ (Catalan's number) different ways, each identified by a distinct parenthesisation of the chain. The best algorithm to select a parenthesisation that…
The exceptional Jordan algebra is the algebra of $3\times 3$ Hermitian matrices with octonionic entries. It is the only one from Jordan's algebraic formulation of quantum mechanics which is not equivalent to the conventional formulation of…
We prove the bivariate Cayley-Hamilton theorem, a powerful generalization of the classical Cayley-Hamilton theorem. The bivariate Cayley-Hamilton theorem has three direct corollaries that are usually proved independently: The classical…
We present matrix identities which yield respectively the Jordan canonical form of the Pascal matrix P_n = (i -1 choose j -1)_{1 <= i,j <= n} modulo a prime, the eigenvectors of (i choose j)_{1 <= i,j <= n}, and the Smith normal form of…
Jordan Normal Forms serve as excellent representatives of conjugacy classes of matrices over closed fields. Once we knows normal forms, we can compute functions of matrices, their main invariant, etc. The situation is much more complicated…
We study the eigenscheme of a matrix which encodes information about the eigenvectors and generalized eigenvectors of a square matrix. The two main results in this paper are this decomposition encodes the numeric data of the Jordan…
We introduce a high-order spline geometric approach for the initial boundary value problem for Maxwell's equations. The method is geometric in the sense that it discretizes in structure preserving fashion the two de Rham sequences of…
While quantum computing provides an exponential advantage in solving system of linear equations, there is little work to solve system of nonlinear equations with quantum computing. We propose quantum Newton's method (QNM) for solving…
Krylov methods rely on iterated matrix-vector products $A^k u_j$ for an $n\times n$ matrix $A$ and vectors $u_1,\ldots,u_m$. The space spanned by all iterates $A^k u_j$ admits a particular basis -- the \emph{maximal Krylov basis} -- which…
Differential equations are one of the main approaches to evaluate multi-loop Feynman integrals. The construction of a canonical or $\varepsilon$-factorised basis for multi-loop integrals remains a key bottleneck for this approach,…
We obtain general upper bounds of the sizes and the numbers of Jordan blocks for the eigenvalues $\lambda \not= 1$ in the monodromies at infinity of polynomial maps.
There exists a generalization of the concept, completely bounded norm for multilinear maps on C*-algebras. We will use the word, Jordan norm, for this norm. The Jordan norm of a multilinear map is obtained via factorizations of the map,…