comptible with ordering */

* * Public functions * *****************************************************************/

simplicial complex(the faces set is ideal h)

insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted

Short Exponent Vectors are used for fast divisibility tests ShortExpVectors "squeeze" an exponent vector into one word as follows: Let n = BIT_SIZEOF_

polynomials in M.mvar() are considered coefficients * M univariate monic polynomial * the coefficients of f are reduced modulo M **/

number of non-zero polys in F

p_GetExpVL is used in Singular,jl

* compute a Groebner basis of an ideal * *****************************************************/

multiplication of 'a' and 'b'; replacement of 'a' by the product a*b

getter @return @a getAlpha() returns @a m_alpha

Return the characteristic of the coeff. domain.

returns Copy(p)*m, does neither destroy p nor m

return the multiplicative inverse of 'a'; raise an error if 'a' is not invertible !!! Recommendation: rename to 'n_Inverse'

sets component of poly a to i

for a monomial p, returns the number of the first block */ where a nonzero exponent is sitting */

compute the leading coefficient of F, where F is considered as an element of \f$ R[x_{1}][x_{2},\ldots ,x_{n}] \f$, order on \f$ Mon (x_{2},\ldots ,x_

* define and execute a new ring which order is (a(va),lp,C) * * ************************************************************/

getter @return @a getLength returns the length of the degree pattern

2 * writes a polynomial p to stdout */

ordered fields: TRUE iff 'a' is larger than 'b'; in Z/pZ: TRUE iff la > lb, where la and lb are the long's representing a and b, respectively in C:

2 * z := i */

2 *looks up the position of p in set *set[0] is the smallest with respect to the ordering-procedure deg/pComp * Assumption: posInS only depends on the

2 * create a copy of the ring r, which must be equivalent to currRing * used for qring definition,.. * (i.e.: normal rings: same nCopy as currRing;

CanonicalForm InternalCF::lc (), Lc (), LC () * @sa CanonicalForm::lc(), Lc(), LC() **/

* define a ring with parameters und change to it * * DefRingPar and DefRingParlp corrupt still memory * ********************************************

* compute the initial form of an ideal <G> w.r.t. a weight vector iva * ************************************************************************/

int ipower ( int b, int m ) * * ipower() - calculate b^m in standard integer arithmetic. * * Note: Beware of overflows. * **/