Changeset e801fe in git for Singular/LIB/invar.lib

Timestamp:

Feb 16, 1998, 1:07:04 PM (26 years ago)

Author:

Gerhard Pfister <pfister@…>

Branches:

(u'spielwiese', 'd1b01e9d51ade4b46b745d3bada5c5f3696be3a8')

Children:

1e7d8d9fbdaf1094cc869ca3a6be98b9e1fbfc9a

Parents:

437e2c21158af6efe6402cc1da62ee40760c03e0

Message:

* updated invar.lib normal.lib, merged prim_dec.lib with primdec.lib


git-svn-id: file:///usr/local/Singular/svn/trunk@1145 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/invar.lib (modified) (13 diffs)

Singular/LIB/invar.lib

@@ -1 @@
-// $Id: invar.lib,v 1.3 1997-09-18 09:58:24 Singular Exp $
+// $Id: invar.lib,v 1.4 1998-02-16 12:07:01 pfister Exp $
 ///////////////////////////////////////////////////////
 // invar.lib
@@ -7 +7 @@
 //////////////////////////////////////////////////////
 
-LIBRARY: invar.lib PROCEDURE FOR COMPUTING INVARIANTS UNDER (C,+)-ACTIONS
+LIBRARY: invar.lib PROCEDURES FOR COMPUTING INVARIANTS OF (C,+)-ACTIONS
 
   invariantRing(matrix m,poly p,poly q,int choose)
@@ -142 +142 @@
 
 
-proc reduction(poly p, ideal mo, list #)
-USAGE:   reduction(p,mo,q); p poly, mo ideal, q (optional) monomial
+proc reduction(poly p, ideal dom, list #)
+USAGE:   reduction(p,dom,q); p poly, dom ideal, q (optional) monomial
 RETURN:  poly= (p-H(f1,...,fr))/q^a, if Lt(p)=H(Lt(f1),...,Lt(fr)) for 
                some polynomial H in r variables over the base field,
                a maximal such that q^a devides p-H(f1,...,fr),
-               mo =(f1,...,fr)
+               dom =(f1,...,fr)
 NOTE:    
 EXAMPLE: example reduction; shows an example
 {
   int i;
-  int z=size(mo);
+  int z=size(dom);
   def bsr=basering;
  
@@ -165 +165 @@
   execute "ring s="+charstr(basering)+",("+varstr(basering)+",@(0..z)),dp;";
   
-  //costructes the ideal mo=(p-@(0),mo[1]-@(1),...,mo[z]-@(z))
-  ideal mo=imap(bsr,mo);
+  //costructes the ideal dom=(p-@(0),dom[1]-@(1),...,dom[z]-@(z))
+  ideal dom=imap(bsr,dom);
   for (i=1;i<=z;i++)
   {
-    mo[i]=lead(mo[i])-var(nvars(bsr)+i+1);
-  }
-  mo=lead(imap(bsr,p))-@(0),mo;
+    dom[i]=lead(dom[i])-var(nvars(bsr)+i+1);
+  }
+  dom=lead(imap(bsr,p))-@(0),dom;
  
   //eliminates the variables of the basering bsr
-  //i.e. computes mo intersected with K[@(0),...,@(z)]
-  ideal kern=eliminate(mo,imap(bsr,v));
+  //i.e. computes dom intersected with K[@(0),...,@(z)]
+  ideal kern=eliminate(dom,imap(bsr,v));
 
   // test wether @(0)-h(@(1),...,@(z)) is in ker for some poly h
@@ -186 +186 @@
      {
         h=(1/h)*kern[i];
-        // defines the map psi : s ---> bsr defined by @(i) ---> p,mo[i]
+        // defines the map psi : s ---> bsr defined by @(i) ---> p,dom[i]
         setring bsr;
-        map psi=s,maxideal(1),p,mo;
+        map psi=s,maxideal(1),p,dom;
         poly re=psi(h);
 
@@ -210 +210 @@
    ring q=0,(x,y,z,u,v,w),dp;
    poly p=x2yz-x2v;
-   ideal mo =x-w,u2w+1,yz-v;
-   reduction(p,mo);
-   reduction(p,mo,w);
-}
-
-///////////////////////////////////////////////////////////////////////////////
-
-proc completeReduction(poly p, ideal mo, list #)
-USAGE:   completeReduction(p,mo,q); p poly, mo ideal, 
+   ideal dom =x-w,u2w+1,yz-v;
+   reduction(p,dom);
+   reduction(p,dom,w);
+}
+
+///////////////////////////////////////////////////////////////////////////////
+
+proc completeReduction(poly p, ideal dom, list #)
+USAGE:   completeReduction(p,dom,q); p poly, dom ideal, 
                                      q (optional) monomial
-RETURN:  poly= the polynomial p reduced with mo via the procedure
+RETURN:  poly= the polynomial p reduced with dom via the procedure
                reduction as long as possible
 NOTE:    
@@ -226 +226 @@
 {
   poly p1=p;
-  poly p2=reduction(p,mo,#);
+  poly p2=reduction(p,dom,#);
   while (p1!=p2)
   {
     p1=p2;
-    p2=reduction(p1,mo,#);
+    p2=reduction(p1,dom,#);
   }
   return(p2);
@@ -238 +238 @@
    ring q=0,(x,y,z,u,v,w),dp;
    poly p=x2yz-x2v;
-   ideal mo =x-w,u2w+1,yz-v;
-   completeReduction(p,mo);
-   completeReduction(p,mo,w);
-}
-///////////////////////////////////////////////////////////////////////////////
-
-proc inSubring(poly p, ideal mo)
-USAGE:   inSubring(p,mo); p poly, mo ideal
-RETURN:  list= 1,string(@(0)-h(@(1),...,@(size(mo)))) :if p = h(mo[1],...,mo[size(mo)])
-              0,string(h(@(0),...,@(size(mo)))) :if there is only a nonlinear relation
-              h(p,mo[1],...,mo[size(mo)])=0.
+   ideal dom =x-w,u2w+1,yz-v;
+   completeReduction(p,dom);
+   completeReduction(p,dom,w);
+}
+///////////////////////////////////////////////////////////////////////////////
+
+proc inSubring(poly p, ideal dom)
+USAGE:   inSubring(p,dom); p poly, dom ideal
+RETURN:  list= 1,string(@(0)-h(@(1),...,@(size(dom)))) :if p = h(dom[1],...,dom[size(dom)])
+              0,string(h(@(0),...,@(size(dom)))) :if there is only a nonlinear relation
+              h(p,dom[1],...,dom[size(dom)])=0.
 NOTE:    
 EXAMPLE: example inSubring; shows an example
 {
-  int z=size(mo);
+  int z=size(dom);
   int i;
   def gnir=basering;
@@ -262 +262 @@
   }
   string eli=string(mile);
-  // the intersection of ideal nett=(p-@(0),mo[1]-@(1),...)
+  // the intersection of ideal nett=(p-@(0),dom[1]-@(1),...)
   // with the ring k[@(0),...,@(n)] is computed, the result is ker
   execute "ring r1="+charstr(basering)+",("+varstr(basering)+",@(0..z)),dp;";
-  ideal nett=imap(gnir,mo);
+  ideal nett=imap(gnir,dom);
   poly p;
   for (i=1;i<=z;i++)
@@ -299 +299 @@
    ring q=0,(x,y,z,u,v,w),dp;
    poly p=xyzu2w-1yzu2w2+u4w2-1xu2vw+u2vw2+xyz-1yzw+2u2w-1xv+vw+2;
-   ideal mo =x-w,u2w+1,yz-v;
-   inSubring(p,mo);
+   ideal dom =x-w,u2w+1,yz-v;
+   inSubring(p,dom);
 }
 
@@ -478 +478 @@
      "                     ";
      karl;
-     pause;
+    // pause;
      "                     ";
   }
@@ -517 +517 @@
        "                                  ";
        karl;
-       pause;
+      // pause;
        "                                  ";
     }
@@ -643 +643 @@
   
 }
-///////////////////////////////////////////////////////////////////////////////