Matrix-Add/-Sub/-Mult so oder mit operator+/-/* ?

compare polynomials

Coprimality Check. f and g are assumed to have the same level. If swap is true, the main variables of f and g are swapped with Variable(1). If the res

computes the reduction of an integer i modulo an ideal which captures a std basis */

* returns the uniformizing parameter in the valuation ring */

*computes a standard basis for h1 and stores the transformation matrix * in ma */

converts mat to module, destroys mat

concat the lists h1 and h2 without zeros

input ideal h (a squarefree monomial ideal) is the ideal associated to simplicial complex, and returns the Stanley-Reisner ideal(minimal generators)

2 * start an example (as a proc), * destroys the string 'example' */

2 * locate `procname` in lib `libname` and find the part `part`: * part=0: help, between, but excluding the line "proc ..." and "{...": * => retur

mat_zz_pE

2 *(s[0],h),...,(s[k],h) will be put to the pairset L */

Check whether the various files exist, return True if so, False otherwise.

* check whether a polynomial of G has least 4 monomials * **********************************************************/

returns the links of face a in simplicial complex X

* Gomega is the initial ideal of G w. r. t. the current weight vector * * curr_weight. Check whether curr_weight lies on a border of the Groebner

multiply a matrix 'a' by a poly 'p', destroy the args

* weigth of a polynomial, for pivot strategy */

munmap for windows */

like getVars but including multiplicities

Make sure that mode contains binary option