Artifact b0118855ebad5423a1a04cc47ab5b03331d3ab4c47e1dbe4fea8e0e3fff30165:

• Executable file r37/lisp/csl/html/r37_0405.html — part of check-in [f2fda60abd] at 2011-09-02 18:13:33 on branch master — Some historical releases purely for archival purposes

  git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 610) [annotate] [blame] [check-ins using] [more...]

<A NAME=gspoly>

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



<B>GSPOLY</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
 <P>
<P>
 <P> <H3> 
syntax: </H3>
<em>gspoly</em>(&lt;p1&gt;,&lt;p2&gt;); 
<P>
<P>
<P>
<P>
where &lt;p1&gt; and &lt;p2&gt; are polynomials. 
<P>
<P>
The <em>subtraction</em> polynomial of p1 and p2 is computed 
corresponding to the method of the Buchberger algorithm for 
computing <em>groebner bases</em>: p1 and p2 are multiplied 
with terms such that when subtracting them the leading terms 
cancel each other. 
<P>
<P>