Related papers: Jordan Normal and Rational Normal Form Algorithms
Let $\mathrm{JT}_\lambda$ be the Jacobi-Trudi matrix corresponding to the partition $\lambda$, so $\det\mathrm{JT}_\lambda$ is the Schur function $s_\lambda$ in the variables $x_1,x_2,\dots$. Set $x_1=\cdots=x_n=1$ and all other $x_i=0$.…
The Jordan totient $J_k(n)$ can be defined by $J_k(n)=n^k\prod_{p\mid n}(1-p^{-k})$. In this paper, we study the average behavior of fractions $P/Q$ of two products $P$ and $Q$ of Jordan totients, which we call Jordan totient quotients. To…
We take an algorithmic and computational approach to a basic problem in abstract algebra: determining the correct generalization to dialgebras of a given variety of nonassociative algebras. We give a simplified statement of the KP algorithm…
An efficient method is proposed for computing the structure of Jordan blocks of a matrix of integers or rational numbers by exact computation. We have given a method for computing Jordan chains of a matrix with exact computation. However,…
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 numbers $f_\lambda$ of standard tableaux of shape $\lambda\vdash n$ satisfy 2 fundamental recursions: $f_\lambda = \sum f_{\lambda^-}$ and $(n + 1)f_\lambda=\sum f_{\lambda^+}$, where $\lambda^-$ and $\lambda^+$ run over all shapes…
Jordan algebras arise naturally in (quantum) information geometry, and we want to understand their role and their structure within that framework. Inspired by Kirillov's discussion of the symplectic structure on coadjoint orbits, we provide…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
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…
We construct a relationship between integral and differential representation of second-order Jordan chains. Conditions to obtain regular potentials through the confluent supersymmetry algorithm when working with the differential…
We formulate a lattice theoretical Jordan normal form theorem for certain nilpotent lattice maps satisfying the so called JNB conditions. As an application of the general results, we obtain a transparent Jordan normal base of a nilpotent…
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…
In this paper we present a pure algebraic construction of the normal factorization of multimode squeezed states and calculate their inner products. This procedure allows one to orthonormalize bases generated by squeezed states. We calculate…
We demonstrate the way to derive the second Painlev\'e equation $P_2$ and its B\"acklund transformations from the deformations of the Nonlinear Schr\"odinger equation (NLS), all the while preserving the strict invariance with respect to the…
Blackbox algorithms for linear algebra problems start with projection of the sequence of powers of a matrix to a sequence of vectors (Lanczos), a sequence of scalars (Wiedemann) or a sequence of smaller matrices (block methods). Such…
For a simple real Jordan algebra $V,$ a family of bi-differential operators from $\mathcal{C}^\infty(V\times V)$ to $\mathcal{C}^\infty(V)$ is constructed. These operators are covariant under the rational action of the conformal group of…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
We adapt the Faddeev-LeVerrier algorithm for the computation of characteristic polynomials to the computation of the Pfaffian of a skew-symmetric matrix. This yields a very simple, easy to implement and parallelize algorithm of…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
Let $N$ be a nilpotent matrix and consider vector fields $\dot\bx=N\bx+\bv(\bx)$ in normal form. Then $\bv$ is equivariant under the flow $e^{N^*t}$ for the inner product normal form or $e^{Mt}$ for the $\ssl_2$ normal form. These vector…