returns the number of maximal block */ appearing among the monomials of p */ the 0th block is the 1st one */

set all exponents l..k to 0, assume exp. k+1..n and 1..l-1 are in different blocks set coeff to 1

//////////////////////////////////////////////////////////////////////// The following routines all take as input a ring r, and return R where R has

sbrk for windows */

returns the set of all squarefree monomials of degree deg in ideal h

* weigth of a polynomial, for pivot strategy */

quick sort @a A

3 * deletes empty objects from a pair set beginning with * pair first * assumes a pair to be empty if .lcm does so */

3 * proves the consistence of the pairset resPairs with the corresponding * set of generators; * only for tests */

CanonicalForm InternalCF::tailcoeff (), int InternalCF::taildegree () * @sa CanonicalForm::tailcoeff(), taildegree() **/

2 *computes the degree of the leading term of the polynomial *with respect to given weights */

Do the actual work

* define and execute a new ring with ordering (M,C) * *****************************************************/

________________1_______________ */

modifies a

CanonicalForm gcd_poly ( const CanonicalForm & f, const CanonicalForm & g ) * * gcd_poly() - calculate polynomial gcd. * * This is the dispatcher

-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/

-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/

checks if entries of @a A are zero

=================== operations ============================*/ 2 * assign a = b */

* * Lcm business * ***************************************************************/ get m1 = LCM(LM(p1), LM(p2))/LM(p1) m2 = LCM(LM(p1), LM(p2))/LM

2 * creates the leading term of the S-polynomial of p1 and p2 * do not destroy p1 and p2 * remarks: * 1. the coefficient is 0 (p_Init) * 1. a) in

2 * check, if a list contains any ring dependend data */