Related papers: An algorithm to compute the canonical basis of an …
We describe a simple algorithm for computing the canonical basis of any irreducible finite-dimensional $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module.
We describe a simple algorithm for computing the canonical basis of any finite-dimensional $U_{q}(sp_{2n})$-module.
We prove a bijection between finite-dimensional irreducible modules for an arbitrary quantum affine algebra $U_q(g)$ and finite-dimensional irreducible modules for its Borel subalgebra $U_q(g)^{\geq 0}$.
A string basis is constructed for each subalgebra of invariants of the function algebra on the quantum special linear group. By analyzing the string basis for a particular subalgebra of invariants, we obtain a ``canonical basis'' for every…
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 derive a straightening-free algorithm that computes the canonical bases of any higher-level q-deformed Fock space.
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
The aim of this paper is to extend the structure theory for infinitely generated modules over tame hereditary algebras to the more general case of modules over concealed canonical algebras. Using tilting, we may assume that we deal with…
The main objective of this project is to determine all irreducible modules of a given modular Lie algebra. In contrast to ordinary Lie algebras, modular Lie algebras require an additional structure known as the p-mapping. The minimal…
Every irreducible finite-dimensional representation of the quantized enveloping algebra U_q(gl_n) can be extended to the corresponding quantum affine algebra via the evaluation homomorphism. We give in explicit form the necessary and…
We construct level-0 modules of the quantum affine algebra $\Uq$, as the $q$-deformed version of the Lie algebra loop module construction. We give necessary and sufficient conditions for the modules to be irreducible. We construct the…
In this paper we classify all simple weight modules for a quantum group $U_q$ at a complex root of unity $q$ when the Lie algebra is not of type $G_2$. By a weight module we mean a finitely generated $U_q$-module which has finite…
We establish a canonical basis character formula for the irreducible modules in arbitrary parabolic BGG-type categories, including the category of finite-dimensional modules, for finite $W$-superalgebras of type $A$. These categories…
We describe an algorithm for computing the $p$-canonical basis of the Hecke algebra, or one of its antispherical modules. The algorithm does not operate in the Hecke category directly, but rather uses a faithful embedding of the Hecke…
We classify irreducible finite-dimensional modules of a collection of real Lie superalgebras that includes the simple ones, their classical variants, complex Lie superalgebras after restriction of scalars, and all real Lie algebras. Our…
We study canonical basis elements in higher-level Fock spaces associated with the quantum group $U_q(\mathfrak{gl}_\infty)$, which are conjecturally related to Calogero-Moser theory for complex reflection groups. We generalize the…
The method of differential equations has been proven to be a powerful tool for the computation of multi-loop Feynman integrals appearing in quantum field theory. It has been observed that in many instances a canonical basis can be chosen,…
Using the skew-symmetry of the differential operators and multiplication operators in the canonical representations of finite-dimensional classical Lie algebras, we obtain some noncanonical polynomial representations of the classical Lie…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…