Related papers: Computing monomial bases in Lie theory using OSCAR
We report on the computer implementation for toric geometry in the computer algebra system $\texttt{OSCAR}$. The main architectural feature of $\texttt{OSCAR}$ is that its four fundamental tools $\texttt{Antic}$ (Hecke, Nemo),…
We apply the Lie algebraic method to reflecting optical systems with plane-symmetric freeform mirrors. Using analytical ray-tracing equations we construct an optical map. The expansion of this map gives us the aberration coefficients in…
In this paper we propose a general method for computing a minimal free right resolution of a finitely presented graded right module over a finitely presented graded noncommutative algebra. In particular, if such module is the base field of…
We describe the cell structure of the affine Temperley-Lieb algebra with respect to a monomial basis. We construct a diagram calculus for this algebra.
Kang, Kashiwara, Kim and Oh have proved that cluster monomials lie in the dual canonical basis, under a symmetric type assumption. This involves constructing a monoidal categorification of a quantum cluster algebra using representations of…
Following a question of Vinberg, a general method to construct monomial bases for finite-dimensional irreducible representations of a reductive Lie algebra was developed in a series of papers by Feigin, Fourier, and Littelmann. Relying on…
A new purely algebraic algorithm is presented for computation of invariants (generalized Casimir operators) of Lie algebras. It uses the Cartan's method of moving frames and the knowledge of the group of inner automorphisms of each Lie…
An algebraic algorithm is developed for computation of invariants ('generalized Casimir operators') of general Lie algebras over the real or complex number field. Its main tools are the Cartan's method of moving frames and the knowledge of…
We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.
In this paper, we study how to quickly compute the <-minimal monomial interpolating basis for a multivariate polynomial interpolation problem. We address the notion of "reverse" reduced basis of linearly independent polynomials and design…
We study the Lie module structure given by the Gerstenhaber bracket on the Hochschild cohomology groups of a monomial algebra with radical square zero. The description of such Lie module structure will be given in terms of the combinatorics…
An algorithm is described to compute the canonical basis of an irreducible module over a quantized enveloping algebra of a finite-dimensional semisimple Lie algebra. The algorithm works for modules that are constructed as a submodule of a…
A set of Maple V R.3/4 computer algebra routines for the analytical solving of 1st. order ODEs, using Lie group symmetry methods, is presented. The set of commands includes a 1st. order ODE-solver and routines for, among other things: the…
We determine a new technique which allows the computation of the arithmetical rank of certain monomial ideals.
We describe an essential improvement of our recent algorithm for computing cohomology of Lie (super)algebra based on partition of the whole cochain complex into minimal subcomplexes. We replace the arithmetic of rational numbers or integers…
We construct common triangular bases for almost all the known (quantum) cluster algebras from Lie theory. These bases provide analogs of the dual canonical bases, long anticipated in cluster theory. In cases where the generalized Cartan…
Let K be a field and denote by K[t], the polynomial ring with coefficients in K. Set A = K[f1,. .. , fs], with f1,. .. , fs $\in$ K[t]. We give a procedure to calculate the monoid of degrees of the K algebra M = F1A + $\times$ $\times$…
This paper shows that to compute the Haar state on $\mathbb{O}(SL_q(n))$, it suffices to compute the Haar states of a special type of monomials which we define as standard monomials. Then, we provide an algorithm to explicitly compute the…
We study the computation of canonical bases of sets of univariate relations $(p_1,\ldots,p_m) \in \mathbb{K}[x]^{m}$ such that $p_1 f_1 + \cdots + p_m f_m = 0$; here, the input elements $f_1,\ldots,f_m$ are from a quotient…
We study the homogeneous coordinate rings of real multiplication noncommutative tori as defined by A. Polishchuk. Our aim is to understand how these rings give rise to an arithmetic structure on the noncommutative torus. We start by giving…