Related papers: An algorithm for computing the global basis of an …

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

The purpose of this paper is to give an explicit description of the irreducible decomposition of the multigraded S_n-module of coinvariants of S_n x S_n. Many of the results presented can be extended to analogous questions for other finite…

We introduce a modified quantum enveloping algebra as well as a (modified) covering quantum algebra for the ortho-symplectic Lie superalgebra osp(1|2). Then we formulate and compute the corresponding canonical bases, and relate them to the…

Let $\pi_1,...,\pi_n$ be an irreducible finite-dimensional $\mathfrak{sl}_2$-modules. Using the theory of the representations of the current algebras, we introduce a several ways to construct a $q$-grading on $\pi_1\otimes...\otimes\pi_n$.…

Let $G= SL_{n+1}$ be defined over an algebraically closed field of characteristic $p > 2$. For each $n \geq 1$ there exists a singular block in the category of $G_1$-modules which contains precisely $n+1$ irreducible modules. We are…

We present an algorithm for computing the structure of any submodule of the module of points of a Drinfeld $A$-module over a finite field, where $A$ is a function ring over $\mathbb F_q$. When the function ring is $A = \mathbb F_q[T]$, we…

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.…

The R-matrix of the symplecto-orthogonal quantum superalgebra U_q(spo(2n|2m)) in the vector representation is calculated, and its basic properties are derived.

Maximizing the sum of two generalized Rayleigh quotients (SRQ) can be reformulated as a one-dimensional optimization problem, where the function value evaluations are reduced to solving semi-definite programming (SDP) subproblems. In this…

We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…

We use the Fock space representation of the quantum affine algebra of type $A^{(2)}_{2n}$ to obtain a description of the global crystal basis of its basic level 1 module. We formulate a conjecture relating this basis to decomposition…

We present a new method for computing core universal solutions in data exchange settings specified by source-to-target dependencies, by means of SQL queries. Unlike previously known algorithms, which are recursive in nature, our method can…

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…

In this paper we develop a classical algorithm of complexity $O(K \, 2^n)$ to simulate parametrized quantum circuits (PQCs) of $n$ qubits, where $K$ is the total number of one-qubit and two-qubit control gates. The algorithm is developed by…

We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $\mathcal…

The aim of this paper is to give a complete classification of irreducible finite dimensional representations of the nonstandard q-deformation U'_q(so(n)) (which does not coincide with the Drinfeld-Jimbo quantum algebra U_q(so(n)) of the…

This paper deals with three technical ingredients of geometry for quantum information. Firstly, we give an algorithm to obtain diagonal basis matrices for submodules of the Z_{d}-module Z_{d}^{n} and we describe the suitable computational…

In this paper, we generalize the notion of border bases of zero-dimensional polynomial ideals to the module setting. To this end, we introduce order modules as a generalization of order ideals and module border bases of submodules with…

We introduce a general constructive method to find a p-basis (and the Ulm invariants) of a finite Abelian p-group M. This algorithm is based on Groebner bases theory. We apply this method to determine the additive structure of…

This article investigates the two-parameter quantum matrix algebra at roots of unity. In the roots of unity setting, this algebra becomes a Polynomial Identity (PI) algebra and it is known that simple modules over such algebra are…