Short overview of
is a kernel extension of
which is designed to fill the present gap in considerably
fast computations within the certain class of noncommutative
The system allows us to handle many problems,
coming from representation theory (including Lie and quantum
algebras), algebraic geometry, theoretical physics and
differential equations. The major tools we use are the
generalization of Buchberger's algorithm for computing Groebner
basis and Schreyer's algorithm for computing syzygies and free
Main computational objects: ideals/modules over noncommutative
G-algebras over various ground fields.
- Many algorithms implemented in kernel (written in
- Intuitive, C-like programming language
- Some algorithms implemented as
- Development started in 2000; currently is not yet distributed.
will be freely available
for most hard- and software platforms (Unix, Windows, Macintosh).