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

* define and execute a new ring with ordering (a(va),Wp(vb),C) * * **************************************************************/

getter @return @a getBeta() returns @a m_beta

static CanonicalForm icontent ( const CanonicalForm & f, const CanonicalForm & c ) * * icontent() - return gcd of c and all coefficients of f which

check if 's' is on

=================== proc =================*/

2 *debugging output: all internal sets, if changed *for testing purpuse only/has to be changed for later use */

2 * delete a */

returns maximal column number in the modul element a (or 0)

from ring.cc

CanonicalForm replacevar ( const CanonicalForm & f, const Variable & x1, const Variable & x2 ) * * replacevar() - replace all occurences of x1 in f

returns the union of two vectors(as the union of sets)

* Compute an intermediate weight vector from iva to ivb w.r.t. * * the reduced Groebner basis G. * * Retu

special version assuming result is already initialized

creates (q,p), use it when q is already shifted return TRUE, if (q,p) is discarded

getter @return @a getGamma() returns @a m_gamma

copies matrix a (from ring r to r)

TRUE iff r represents an algebraic or transcendental extension field */

TRUE iff r represents a transcendental extension field

TRUE iff n has a multiplicative inverse in the given coeff field/ring r

test if the monomial is a constant as a vector component i.e., test if all exponents are zero

we keep this otherwise superfluous method for compatibility reasons towards the SINGULAR svn trunk */

getter @return @a getGFName() returns @a m_GFName

CanonicalForm maxNorm ( const CanonicalForm & f ) * * * maxNorm() - return maximum norm of `f'. * * That is, the base coefficient of `f' with the

returns m*p, does neither destroy p nor m

2 * simplify x */

let's inline those, so that we can call them from the debugger

swap entry @a i and @a j in @a A

Do the actual work

* If target_ord = intmat(A1, ..., An) then calculate the perturbation * * vectors

Reset this polynomial Enumerator with a different input polynomial

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

* returns gcd of integers a and b * ********************************************************************/