* creates an intvec of the monomial order Wp(ivstart) * ***********************************************************************

returns N_{a-b}

bivariate factorization over finite fields as decribed in "Factoring multivariate polynomials over a finite field" by L Bernardin.

2 *cancels the i-th polynomial in the standardbase s */

2 *(s[0],h),...,(s[k],h) will be put to the pairset L(via initenterpairs) *superfluous elements in S will be deleted */

change the current ring to a new ring which is in num new variables

naive factor recombination as decribed in "Factoring multivariate polynomials over a finite field" by L Bernardin.

{{{ predicates

delete id[j], if LT(j) == coeff*mon*LT(i) and vice versa, i.e., delete id[i], if LT(i) == coeff*mon*LT(j)

reduces ideal id modulo <y_i^2> , i = iFirstAltVar .. iLastAltVar returns the reduced ideal or zero ideal.

* * Routines related for ring changes during std computations * ***************************************************************/

compressing two polynomials F and G, M is used for compressing, N to reverse the compression

Computes the content and (inplace) divides it out on a collection of numbers number @em c is the content (i.e. the GCD of all the coeffs, which we div

(inplace) Clears denominators on a collection of numbers number @em d is the LCM of all the coefficient denominators (i.e. the number with which all t

return the (iParameter^th) parameter as a NEW number NOTE: parameter numbering: 1..n_NumberOfParameters(...)

* create a number from int * TODO: do not create an mpz if not necessary */

* changes a polynomial g with the help p-t such that * 1) each term of g has a distinct monomial in x * 2) no term of g has a coefficient divisible

Splits *p into two polys: *q which consists of all monoms with component == comp and *p of all other monoms *lq == pLength(*q) On return all component

2 *test if a monomial /head term is a pure power, * i.e. depends on only one variable */

returns the LCM of the head terms of a and b in *m

for links*******************************************/ the image phi(pv)=pv minus av minus bv

Read a dictionary saved as a textfile

Converts SBpoly into a poly and detroys bucket

{{{ int InternalPrimePower::sign () const docu: see CanonicalForm::sign()

3 * initialize a module */

works only for column in the first half

intentionally not bool, so we can also do q = p + test_arg(p, type);

=================== general utilities ============================*/