helper function

method suggested by Hans Schoenemann to multiply elements in finite fields on 32bit and 64bit machines

restores pFDeg and pLDeg:

for sba, sorting syzygies

misc things

---------------------------------------------------------------------*/ * @brief meta function for binding a signal to an handler @param[in] sig

Start the worker thread.

Returns the specified submatrix. The endRow and endColumn are not included. */

CanonicalForm vcontent ( const CanonicalForm & f, const Variable & x ) * * vcontent() - return content of f with repect to variables >= x. * * The

returns the set of nonfaces p where mabconditionv(h, p, a, b) is true

* define a lexicographic order matrix as intvec * ***********************************************************************

2 * init a new voice similar to the current */

2 *computes the binomial coefficient */

2 *tests if p.p=monomial*unit and cancels the unit */

performs polynomial division and overrides p by the remainder of division of p by the reducer; modifies p */

* returns the polynomial ring over the valuation ring */

m * p */

generic*/

*interreduce F * *****************/

2 * merge set B into L */

* return maximal polynomial length of G * *****************************************/

* Check whether the helpfiles have been downloaded and the relevant * vectors have been calculated and saved. Furthermore, the local static * variab

return the numerator of n (if elements of r are by nature not fractional, result is n)

for r a field, return n_Init(0,r) always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a n_IntMod(a,b,r) >=0

* returns true, if valuation non-trivial, false otherwise */

* Assigns the value to z. z must have been initialized as a gmp variable. */

3 * deletes a resolution */

3 * minimizes any kind of resolution */