File r37/lisp/csl/html/r37_0383.html from the latest check-in

<A NAME=dd_groebner>

<TITLE>dd_groebner</TITLE></A>
<b><a href=r37_idx.html>INDEX</a></b><p><p>



<B>DD_GROEBNER</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
For a homogeneous system of polynomials under 

<A HREF=r37_0364.html>graded term order</A>, 
<A HREF=r37_0357.html>gradlex term order</A>, 

<A HREF=r37_0358.html>revgradlex term order</A> <P>
<P>
or 
<A HREF=r37_0363.html>weighted term order</A> 
a Groebner Base can be computed with limiting the grade 
of the intermediate S polynomials: 
 <P> <H3> 
syntax: </H3>
<P>
<P>
<em>dd_groebner</em>(&lt;d1&gt;,&lt;d2&gt;,&lt;plist&gt;) 
<P>
<P>
<P>
where &lt;d1&gt; is a non negative integer and &lt;d2&gt; is an integer 
or ``infinity&quot;. A pair of polynomials is considered 
only if the grade of the lcm of their head terms is between 
&lt;d1&gt; and &lt;d2&gt;. 
For the term orders <em>graded</em> or <em>weighted</em> the (first) weight 
vector is used for the grade computation. Otherwise the total 
degree of a term is used. 
<P>
<P>