deprecated: for use in getting the mult. matrix elements*/ ring r must be a currRing! */ for consistency, copies a poly from the comm. r->GetNC()->bas

assumes a bivariate poly as input

2 * int -> number */

* * Debugging/statistics of pDivisibleBy * ***************************************************************/

This is a very dirty way to cancel monoms whose number equals the MinPoly

returns p + m*q destroys p, const: q, m

2 * convert monomial given as string to poly, e.g. 1x3y5z */

! used for GB over ZZ: intermediate reduction by monomial elements background: any known constant element of ideal suppresses interm

Performs a Gauss reduction and returns the number of row swaps (and negative scalings) done. The result is a matrix in row echelon form. The pivo

Calls reduce() and constructs matrix whose rows forms a basis of the kernel of the linear map defined by the original matrix. The return val

wrt. Variable (1)

Converts SBpoly into a poly and clears bucket i.e., afterwards SBpoly == 0

return x_i * pPoly; preserve pPoly.

LPolyOld::LPolyOld(poly t,int i,poly p, RuleOld* r, bool b) { set(t,i,p,r); del = b; } */

exactly divide matrix by b

Extract C-style string

2 * computes the betti numbers from a given resolution * of length 'length' (0..length-1), not necessairily minimal, * (if weights are given, they are

3 * FOR THE HOMOGENEOUS CASE ONLY! * looks through the pair set and the given module for * remaining pairs or generators to consider * returns a point

3 * initializes all entres of a pair */

returns intersection of vectors p and q, returns empty if they are disjoint

the quotient ring of two ideals which are represented by vectors, the result is also represented by vector.

returns true if vec1 is contained in vec2

nonMonicHenselLift2

* compute a next weight vector * ********************************/

* return intvec = (1, ..., 1) * *******************************/