Related papers: An algorithm for the computation of the decomposit…
In a previous paper, we described a computer program called Qubiter which can decompose an arbitrary unitary matrix into elementary operations of the type used in quantum computation. In this paper, we describe a method of reducing the…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
We give an algorithm for computing matrix corepresentations for special linear and special unitary quantum groups using a combinatorial re-indexing of basis elements.
Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…
This paper has been withdrawn because of a gap in the proof of Lemma 3.10. The main reults in this paper have now been proved, and extended in the following papers: S. Ariki and A. Mathas, The number of simple modules of the Hecke algebras…
We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…
In this paper, we present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of a real symmetric matrix. The core of this algorithm is a decomposition theorem, which is used to deal with simplicial…
We give a classification of the simple modules for the cyclotomic Hecke algebras over $\mathbb{C}$ in the modular case. We use the unitriangular shape of the decomposition matrices of Ariki-Koike algebras and Clifford theory.
In this paper, we develop a polynomial time algorithm to compute a Dulmage-Mendelsohn-type decomposition of a matrix partitioned into submatrices of rank at most $1$.
We study the blocks for Ariki-Koike algebras using a general notion of core for $l$-partitions. We interpret the action of the affine symmetric group on the blocks in the context of level rank duality and study the orbits under this action.
New methods for $D$-decomposition analysis are presented. They are based on topology of real algebraic varieties and computational real algebraic geometry. The estimate of number of root invariant regions for polynomial parametric families…
In this study, an algorithm for computing the inverse of periodic k banded matrices, which are needed for solving the differential equations by using the finite differences, the solution of partial differential equations and the solution of…
Lie-Trotter-Suzuki decompositions are an efficient way to approximate operator exponentials $\exp(t H)$ when $H$ is a sum of $n$ (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…
A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the…
Let $S(\Lambda)$ be the cyclotomic q-Schur algebra associated to the Ariki-Koike algebra $H$. We construct a certain subalgebra $S^0(\Lambda)$ of $S(\Lambda)$, and show that it is a standardly based algebra in the sense of Du and Rui.…
The polar decomposition of a matrix is a key element in the quantum linear algebra toolbox. We show that the problem of quantum polar decomposition, recently studied in Lloyd et al. [LBP+20], has a simple and concise implementation via the…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
We study the decomposition matrices for the unipotent $\ell$-blocks of finite special unitary groups SU$_n(q)$ for unitary primes $\ell$ larger than $n$. Up to very few unknown entries, we give a complete solution for $n=2,\ldots,10$. We…