Related papers: An algorithm for the computation of the decomposit…
We present some blocks of Ariki-Koike algebras $\mathcal{H}_{n,r}$ for which the decomposition matrices are independent of the characteristic of the underlying field. We complete the description of the graded decomposition numbers for…
We compute the generic degrees of the Ariki--Koike algebras by first constructing a basis of matrix units in the semisimple case. As a consequence, we also obtain an explicit isomorphism from any semisimple Ariki--Koike algebra to the group…
In this paper we present an efficient algorithm to compute the eigen decomposition of a matrix that is a weighted sum of the self outer products of vectors such as a covariance matrix of data. A well known algorithm to compute the eigen…
Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a…
This paper uses matrix transformations to provide the Autoone-Takagi decomposition of dual complex symmetric matrices and extends it to dual quaternion $\eta$-Hermitian matrices. The LU decomposition of dual matrices is given using the…
Following ideas of Geck and Rouquier, we show that there exists a ``canonical basic set'' of Specht modules in bijection with the simple modules of Ariki-Koike algebras at roots of unity. Moreover, we determine the parametrization of this…
Deterministic recursive algorithms for the computation of generalized Bruhat decomposition of the matrix in commutative domain are presented. This method has the same complexity as the algorithm of matrix multiplication.
We consider the representation theory of the Ariki-Koike algebra, a $q$-deformation of the group algebra of the complex reflection group $C_r \wr \mathfrak{S}_n$. We examine blocks of the Ariki-Koike algebra. In particular, we prove a…
We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…
In this article the quantized matrix algebras as in the title have been studied at a root of unity. A full classification of simple modules over such quantized matrix algebras of rank $2$ along with a class of finite dimensional…
We present a fast randomized algorithm that computes a low rank LU decomposition. Our algorithm uses random projections type techniques to efficiently compute a low rank approximation of large matrices. The randomized LU algorithm can be…
We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…
This note is concerned with a natural generalization of the Mullineux involution for Ariki-Koike algebras. Using a result of Fayers together with previous results by the authors, we give an efficient algorithm for computing this generalized…
Making new methods for quantum problems often relies on using basic operations in linear algebra. Often these routines are hidden behind well-known libraries that have been optimized over decades. Attempting to improve on those basic…
This paper presents a systematic methodology based on the algebraic theory of signal processing to classify and derive fast algorithms for linear transforms. Instead of manipulating the entries of transform matrices, our approach derives…
A $q$-analogue of combinatorics concerning the Cartan matrix for the Iwahori-Hecke algebra of type $A$ is investigated. We give several descriptions for the determinant of the graded Cartan matrix, which imply some combinatorial identities.…
The matrix LU factorization algorithm is a fundamental algorithm in linear algebra. We propose a generalization of the LU and LEU algorithms to accommodate the case of a commutative domain and its field of quotients. This algorithm…
The QLP decomposition is one of the effective algorithms to approximate singular value decomposition (SVD) in numerical linear algebra. In this paper, we propose some single-pass randomized QLP decomposition algorithms for computing the…
We study the natural labeling of the one dimensional representations for Ariki-Koike algebras at roots of unity. For Hecke algebras of types A and B, some of these representations can be identified with the socle of the Steinberg…
The aim of this note is to study a generalization of theorems by James and Fayers on the modular representations of the symmetric group and its Hecke algebra to the case of the complex reflection groups of type $G(l,1,n)$ and the associated…