相关论文: Littlewood's algorithm and quaternion matrices

The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…

In this paper, we give several matrix representations for the Horadam quaternions. We derive several identities related to these quaternions by using the matrix method. Since quaternion multiplication is not commutative, some of our results…

By analyzing an optimization problem over orthogonal matrices, we prove a generalization of the Hardy-Littlewood-P\'olya rearrangement inequality to positive definite matrices. The inequality is then extended to rectangular matrices. Using…

The main properties of hypercomplex generalization of quaternion system as antiquaternion are presented in this article. Definitions and studied of antiquaternions conjugation are introduced, their norm and zero divisor, and how to perform…

We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…

Recently the authors investigated the Lipschitz triviality of simple germs of matrices. In this work, we improve some previous results and we present an extension of an integral closure result for the real setting. These tools are applied…

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially…

Structured canonical forms under unitary and suitable structure-preserving similarity transformations for normal and (skew-)Hamiltonian as well as normal and per(skew)-Hermitian matrices are proposed. Moreover, an algorithm for computing…

We introduce a super version of the Littlewood--Richardson rule for super Schur functions over signed alphabets. We give in particular combinatorial interpretations of the super Littlewood--Richardson coefficients using the properties of…

Triangular factorizations are an important tool for solving integral equations and partial differential equations with hierarchical matrices ($\mathcal{H}$-matrices). Experiments show that using an $\mathcal{H}$-matrix LR factorization to…

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

Littlewood-Richardson rule gives the decomposition formula for the multiplication of two Schur functions, while the decomposition formula for the multiplication of two Hall-Littlewood functions or two universal characters is also given by…

We consider Brownian motions and other processes (Ornstein-Uhlenbeck processes, spherical Brownian motions) on various sets of symmetric matrices constructed from algebra structures, and look at their associated spectral measure processes.…

A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…

Remarkably simple closed-form expressions for the elements of the groups SU(n), SL(n,R), and SL(n,C) with n=2, 3, and 4 are obtained using linear functions of biquaternions instead of n x n matrices. These representations do not directly…

In this paper we find a Clifford algebra associated to generalized Fibonacci quaternions. In this way, we provide a nice algorithm to obtain a division quaternion algebra starting from a quaternion non-division algebra and vice-versa.

We give a new quantum circuit approximation of quantum multiplexors based on the idea of complexity theory oracles. As an added bonus, our multiplexor approximation immediately gives a quantum circuit approximation of diagonal unitary…

In this article, we give the most genaral form of the quaternions algebra depending on 3-parameters. We define 3-parameter generalized quaternions (3PGQs) and study on various properties and applications. Firstly we present the definiton,…

Given a set of $n$ distinct real numbers, our goal is to form a symmetric, unreduced, tridiagonal, matrix with those numbers as eigenvalues. We give an algorithm which is a stable implementation of a naive algorithm forming the…

We produce a family of reductions for Schubert intersection problems whose applicability is checked by calculating a linear combination of the dimensions involved. These reductions do not alter the Littlewood-Richardson coefficient, and…