* Initialise the machine learning system by starting the python * interpreter, downloading the helpfiles if * not present, and calculating the bag

henselLiftAndEarly, nonMonicHenselLift

returns TRUE, if r is a field or r has no zero divisors (i.e is a domain)

if r is a ring with zero divisors, return an annihilator!=0 of b otherwise return NULL

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

conversion of n to a GMP integer; 0 if not possible

6 * creates the commutative lcm(lm(p1),lm(p2)) * do not destroy p1 and p2 */

returns [p,q], destroys p

2 * za >= 0 ? */

* create a number from int */

Construct reference data object marked by given identifier number

ExpVector(pr) = ExpVector(p1) + ExpVector(p2)

order

2 * returns the i-th power of p * p will be destroyed */

CanonicalForm pp ( const CanonicalForm & f ) * * pp() - return primitive part of f. * * Returns zero if f equals zero, otherwise f / content(f).

for the number of divisions of two monomials; these are all guaranteed to work, i.e., m1/m2 only

input is a squarefree monomial p output is all the squarefree monomials which could divid p(including p itself?)

* Sort the rows of the matrix and remove duplicate rows. */

2 * divides out the weight monomials (given by the Schreyer-ordering) * from the LaScala-resolution */

Check whether (shared) data was initialized but not assigned yet.

* define a reverse lexicographic order (dp) matrix as intvec * ***********************************************************************

We agree the that result of a singular -> fmpq_mpoly conversion is readonly. This restricts the usage of the result in flint functions to cons

* * divisibility * ***************************************************************/ return: FALSE, if there exists i, such that a->exp[i] > b->exp[