print vector of vectors of integers.

2 * maps the expression w to res, * switch what: MAP_CMD: use theMap for mapping, N for preimage ring * //FETCH_CMD: use pOrdPoly for map

** *F maPoly_InsertMonomial . . . . . . . . .insertion of a monomial into mapoly */

GCD of A and B over \f$ F_{p} \f$

GCD of A and B over \f$ F_{p}(\alpha ) \f$

GCD of A and B over GF

computes the gcd and the cofactors of u and v gcd(u,v) = u3 = u*u1 + v*u2

2*/ returns the determinant of the matrix m; uses Bareiss algorithm

2 *exact divisor: let d == x^i*y^j, m is thought to have only one term; * return m/d iff d divides m, and no x^k*y^l (k>i or l>j) divides m * cons

access

strcpy where source and destination may overlap

write to the output buffer of the currently used reporter CF: the "&" should be removed, as one wants to write constants as well

2 * convert a number to an int in (-p/2 .. p/2] */

* create a number from int */

Returns TRUE if * LM(p) | LM(lcm) * LC(p) | LC(lcm) only if ring * Exists i, j: * LE(p, i) != LE(lcm, i) * LE(p1, i)

2 * xx,q: arrays of length 0..rl-1 * xx[i]: SB mod q[i] * assume: char=0 * assume: q[i]!=0 * x: work space * destroys xx */

/ * compare a and b */

2 *returns TRUE if p1 is a skalar multiple of p2 *assume p1 != NULL and p2 != NULL */

* * Dispatcher to r->p_Procs, they do the tests/checks * ***************************************************************/ returns a copy of p (with

* lift ideal with coeffs over Z (mod N) to Q via Farey */

returns x-coeff of p, i.e. a poly in x, s.t. corresponding xd-monomials have the same D-part and the component 0 does not destroy p */

either poly(1) or gen(k)?!

* p_LmDivisibleBy checks also the divisibility of coefficients **/

* * checking for ring stuff * ***************************************************************/

The coefficient will be compared in absolute value

returns merged p and q, assumes p and q have no monomials which are equal

sorts p using bucket sort: returns sorted poly assumes that monomials of p are all different reverses it first, if revert == TRUE, use this if input p

p_WTotalDegree for weighted orderings whose first block covers all variables

Classify the input vectors

use this for global orderings consisting of two blocks

2 * create a copy of the ring r * used for qring definition,.. * DOES NOT CALL rComplete */

Finds p^th IS ordering, and returns its position in r->typ[] returns -1 if something went wrong! p - starts with 0!

factorize a squarefree bivariate polynomial over \f$ Q(\alpha) \f$. @ return @a ratBiSqrfFactorize returns a list of monic factors, the first element

2 *reorders L with respect to posInL */

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

Set size of mantissa * digits - the number of output digits (basis 10) * the size of mantissa consists of two parts: * the "output" part a and

* select the pivotrow and store it to red and piv */

* clean m_act from zeros (after elim) */

-> void rootContainer::solver()