Artifact 862931018fabdc78b45af835324ab30084f11ca4cd7ddc3e234bacfa4c639a67:

• Executable file r37/lisp/csl/html/r37_0388.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: 742) [annotate] [blame] [check-ins using] [more...]

<A NAME=hilbertpolynomial>

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



<B>HILBERTPOLYNOMIAL</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
 <P>
<P>
 <P> <H3> 
syntax: </H3>
hilbertpolynomial(&lt;bas&gt;) 
<P>
<P>
<P>
<P>
where &lt;bas&gt; is a 
<A HREF=r37_0382.html>groebner</A> basis in the 
current 
<A HREF=r37_0353.html>term order</A>. 
<P>
<P>
The degree of the <em>Hilbert polynomial</em> is the 
dimension of the ideal spanned by the basis. For an 
ideal of dimension zero the Hilbert polynomial is a 
constant which is the number of common zeros of the 
ideal (including eventual multiplicities). 
The <em>Hollmann algorithm</em> is used. 
<P>
<P>