Calix |
In fact, Calix implements a `critical pair/completion' algorithm that is highly adjustable by plugging in different domains for the coefficients, the terms, the (non-commutative) polynomials, the simplifiers, the critical elements.
Calix already provides several domains for Gröbner bases and involutive bases computations
Calix is able to compute the representation of the Gröbner bases polynomials with respect to the given ones.
This web page is under construction. For more information contact me personally via email.
Calix |