Related papers: An algorithm to compute the canonical basis of an …
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula…
A novel algebra underlying integrable systems is shown to generate and unify a large class of quantum integrable models with given $R$-matrix, through reductions of an ancestor Lax operator and its different realizations. Along with known…
The irreducible modules for the parafermion vertex operator algebra associated to any finite dimensional Lie algebra and any positive integer are identified, the quantum dimensions are computed and the fusion rules are determined.
In this paper, we give a complete classification of irreducible bounded weight modules over the derivation Lie algebras of rational quantum tori
The formula-evaluation problem is defined recursively. A formula's evaluation is the evaluation of a gate, the inputs of which are themselves independent formulas. Despite this pure recursive structure, the problem is combinatorially…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
Let $\bbcq$ be the quantum torus associated with the $d \times d$ matrix $q = (q_{ij})$, $q_{ii} = 1$, $q_{ij}^{-1} = q_{ji}$, $q_{ij}$ are roots of unity, for all $1 \leq i, j \leq d.$ Let $\Der(\bbcq)$ be the Lie algebra of all the…
The dual basis of the canonical basis of the modified quantized enveloping algebra is studied, in particular for type $A$. The construction of a basis for the coordinate algebra of the $n\times n$ quantum matrices is appropriate for the…
Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomposition. This is the algorithm for computing the Smith…
In this paper, we construct a new class of modules over the Block algebra $\BB(q)$, where $q$ is a nonzero complex number. We determined the irreducibilities of these modules and the isomorphisms among them.
We classify the simple infinite dimensional integrable modules with finite dimensional weight spaces over the quantized enveloping algebra of an untwisted affine algebra. We prove that these are either highest (lowest) weight integrable…
We define a filtration indexed by the integers on the tensor product of an integrable highest weight module and a loop module for a quantum affine algebra. We prove that the filtration is either trivial or strictly decreasing and give…
Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. We construct the canonical basis of ${\mathbf U}_q^-$ by applying the folding theory of quantum groups, and piecewise linear parametrization of canonical basis.…
Let $C$ be a symmetrizable generalized Cartan Matrix, and $q$ an indeterminate. ${\fg}(C)$ is the Kac-Moody Lie algebra and $U=U_q({\fg}(C))$ the associated quantum enveloping algebra over $ k={\Bbb Q}(q)$. The quantum function algebra…
We construct new irreducible weight modules over quantum affine algebras of type I with all weight spaces infinite-dimensional. These modules are obtained by parabolic induction from irreducible modules over the Heisenberg subalgebra.
In this note we provide an algorithm for computing the fractional integrals of orthogonal polynomials, which is more stable than that using the expression of the polynomials w.r.t. the canonical basis. This algorithm is aimed at solving…
The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…
We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…