arithmetic

we must always have this test!

copy the submatrix of b, staring at (a,b) having n rows, m cols into the given matrix at pos. (c,d) needs c+n, d+m <= rows, cols a+n, b+m <= b.rows(),

creates if possible (q,p), (shifts(q),p)

2 * leave a voice: kill local variables * setup everything from the previous level * return 1 if leaving the top level, 0 otherwise */

2 *construct the set s from F */

2 *utilities for TSet, LSet */

=========================== insert general node in list =========================== */

///////////////////////////////////////////////////////////////////// Add to Bucket a poly ,i.e. Bpoly == q+Bpoly

* * Creates S-Poly of p1 and p2 * * ***************************************************************/

* * Routines for backwards-Compatibility * * ***************************************************************/

Tests:

beware that ExtGCD is only relevant for a few chosen coeff. domains and may perform something unexpected in some cases...

assume that r is a quotient field (otherwise, return 1) for arguments (a1/a2,b1/b2) return (lcm(a1,b2)/1)

Returns the number of parameters

only used by slimgb (tgb.cc)

unshifts the monomial m

returns m*Copy(p), does neither destroy p nor m

//////////////////////////////////////////////////////////////////// prMove

Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies

/

2 *if ecart1<=ecart2 it returns TRUE */

3 * deletes all entres of a pair */

2 * in the case of a standardbase of a module over a qring: * replace polynomials in i by ak vectors, * (the polynomial * unit vectors gen(1)..gen(ak)