InternalCF * InternalCF::sqrt () * @sa CanonicalForm::sqrt() **/

------------------ Monomial related ------------------ int divides(const Vektor& q) const { assert(size()==q.size()); int n=v.size();

3 * puts a pair into the right place in resPairs */

3 * performs the modification of a single reduction on the syzygy-level */

p must be the monomial which is a face ideal sub=psubset(b); bvs=supports(sub);

For computation of X_n***********************************/

squarefree factorization over \f$ F_{p} \f$. If input is not monic, the leading coefficient is dropped @return a list of squarefree factors with mult

read only access to NC matrices C/D: get C_{i,j}, 1 <= row = i < j = col <= N

get D_{i,j}, 1 <= row = i < j = col <= N

* Look for the smallest absolut value in vec * **********************************************/

* return the dot product of two intvecs a and b * ***************************************************/

* create a weight matrix order as intvec of an extra weight vector (a(iv),M(iw)) * *******************************************************************

* return an initial form of the polynom g w.r.t. a weight vector curr_weight * **********************************************************************

* Compute a next weight vector between curr_weight and target_weight * * with respect to an ideal <G>. * *******

* compute a weight degree of a polynomial p w.r.t. a weight_vector * ********************************************************************/

* perturb the matrix order of "lex" * **************************************/

the minimal total degree of lcoeffs of polys in PS wrt. x for those polys having degree degpsmin in x. F will be assigned the minimal number of terms

copy not immediate number a

This can only be used in the case of coefficients coming from a field or at least an integral domain. */