resets the pFDeg and pLDeg: if pLDeg is not given, it is set to currRing->pLDegOrig, i.e. to the respective LDegProc which only uses pFDeg (and not p_

2 *divides p1 by its leading coefficient */

DO NOT USE; just here for compatibility reasons towards the SINGULAR svn trunk */

Calculate the Euclidean distance between two vectors.

Iterations

* create a weight matrix order as intvec of an extra weight vector (a(iv),lp)* ***********************************************************************

* compute a Groebner basis of an homogeneous ideal * *****************************************************/

/////////////////////////////////////////////////////////////////////////// NAME: convertZZ2CF DESCRIPTION: Routine for conversion of integers repres

======================================== Criterion 1, i.e. Faugere's F5 Criterion ======================================== */

===================================== Criterion 2, i.e. Rewritten Criterion ===================================== */

h1 + h2

2 * compute the syzygies of h1 in R/quot, * weights of components are in w * if setRegularity, return the regularity in deg * do not change h1, w */

initialise the maximal ideal (at 0)

typ dot(Vector<typ> const &b)const { return dot(toVector(),b); }*/

2 *checks the change degree and write progress report */

output the coeff description

Newton interpolation - Incremental algorithm. Given a list of values alpha_i and a list of polynomials u_i, 1 <= i <= n, computes the interpolation po

2 * subtract p2 from p1, p1 and p2 are destroyed * do not put attention on speed: the procedure is only used in the interpreter */

the type of the coefficient filed of r (n_Zp, n_Q, etc)

computes a random monic irreducible univariate polynomial in x over Fp of degree i via NTL/FLINT

/////////////////////////////////////////////// CanonicalForm in Z_p(a)[X] to NTL ZZ_pEX ///////////////////////////////////////////////

Replaces argument by a shallow copy of the references data

* * deriv() - return the formal derivation of CO. * * deriv() derives CO with respect to its main variable. Returns * zero from the current domai

2 * puts signature p.sig to the set syz */

find an element @a x @return @a find returns the index + 1 of @a x, if @a x is an element of the degree pattern, 0 otherwise