Related papers: An algorithm for the computation of the decomposit…
We propose to reduce the decoding complexity of polar codes with non-Arikan kernels by employing a (near) ML decoding algorithm for the codes generated by kernel rows. A generalization of the order statistics algorithm is presented for soft…
Singular value decompositions of matrices are widely used in numerical linear algebra with many applications. In this paper, we extend the notion of singular value decompositions to finite complexes of real vector spaces. We provide two…
We show that coefficients in unicellular LLT polynomials are evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements. We express these in terms of traditional trace bases, induction, and Kazhdan-Lusztig R-polynomials.
We analyze two algorithms for computing the symplectic $LL^T$ factorization $A=LL^T$ of a given symmetric positive definite symplectic matrix $A$. The first algorithm $W_1$ is an implementation of the $HH^T$ factorization from [Dopico et…
We present an algorithm for list decoding codewords of algebraic number field codes in polynomial time. This is the first explicit procedure for decoding number field codes whose construction were previously described by Lenstra and…
For any quantum group of finite ADE type, we prove a new formula for the standard bilinear form evaluated at monomials. Combining this with ideas from the Lusztig-Shoji algorithm, we obtain a new algorithm that computes the canonical basis.…
We settle a long-standing problem in the theory of Hecke algebras of complex reflection groups by constructing many (graded) integral cellular bases of these algebras. As applications, we explicitly construct the simple modules of Ariki's…
Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which…
We present an algorithm which computes a cylindrical algebraic decomposition of a semialgebraic set using projection sets computed for each cell separately. Such local projection sets can be significantly smaller than the global projection…
The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…
In this note, we intend to produce all latin squares from one of them using suitable move which is defined by small trades and do the similar work on 4-cycle systems. These problems, reformulate as finding basis for the kernel of special…
In this paper we generalize a theorem due to Lyle, extending its application to the setting of the Ariki-Koike algebra, and in doing so establish an analogue of the kernel intersection theorem. This in turn provides us with a means towards…
In this paper, we prove a decomposition formula for the Kazhdan-Lusztig basis of affine Hecke algebras of rank 2 with positive weight function. Then we discuss some applications of this kind of decomposition to Lusztig's conjectures P1-P15.
Lattice reduction algorithms, such as the LLL algorithm, have been proposed as preprocessing tools in order to enhance the performance of suboptimal receivers in MIMO communications. In this paper we introduce a new kind of lattice…
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…
This article investigates atomic decompositions in geometric lattices isomorphic to the partition lattice $\Pi(X)$ of a finite set $X$, a fundamental structure in lattice theory and combinatorics. We explore the role of atomicity in these…
In this paper, we propose a new unified optimization algorithm for general tensor decomposition which is formulated as an inverse problem for low-rank tensors in the general linear observation models. The proposed algorithm supports three…
We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of…
We consider fundamental facts from the theory of Hopf superalgebras. We use them to construct the quantum double of the quantum superalgebra $sl(2|1)$ at roots of unity. Thus we obtain a multiplicative formula for universal $R$-matrix. Next…
We classify the core blocks of Ariki-Koike algebras by their moving vectors. Using this classification, we obtain a necessary and sufficient condition for Scopes equivalence between two core blocks, and express the number of simple modules…