Changeset 453c2d in git

Timestamp:

Nov 22, 2006, 10:40:29 PM (17 years ago)

Author:

Viktor Levandovskyy <levandov@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '0604212ebb110535022efecad887940825b97c3f')

Children:

0d8f37995e9b1387eccdb6e605e94ea50e2f0942

Parents:

24e56ccf41ae2c738ecb93810f84af186c73c6f5

Message:

*levandov: replaced std with groebner, aux vars y through @y


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

File:

• Singular/LIB/sagbi.lib (modified) (10 diffs)

Singular/LIB/sagbi.lib

@@ -1 +1 @@
 //////////////////////////////////////////////////////////////////////////////
-version="$Id: sagbi.lib,v 1.4 2005-06-07 10:05:19 Singular Exp $";
+version="$Id: sagbi.lib,v 1.5 2006-11-22 21:40:29 levandov Exp $";
 category="Commutative Algebra";
 info="
@@ -50 +50 @@
   if(b!=0)
     {
-      id =reduce(id,std(0));
+      id =reduce(id,groebner(0));
     }
   int n,m=nvars(bsr),ncols(id);
@@ -75 +75 @@
     //==================create anew ring with extra variables================
 
-      execute("ring R1="+charstr(bsr)+",("+varstr(bsr)+",y(1..m)),(dp(n),dp(m));");
+      execute("ring R1="+charstr(bsr)+",("+varstr(bsr)+",@y(1..m)),(dp(n),dp(m));");
       execute("minpoly=number("+mp+");");
       ideal id=imap(bsr,id);
@@ -82 +82 @@
       for(z=1;z<=m;z++)
         {
-          A[z]=lead(id[z])-y(z);
-        }
-
-      A=std(A);
+          A[z]=lead(id[z])-@y(z);
+        }
+
+      A=groebner(A);
       ideal kern=nselect(A,1,n);// "kern" is the kernel of the ring map:
                            // R1----->bsr ;y(z)----> lead(id[z]).
@@ -151 +151 @@
 
   if(size(I)==0)
-    {@result=std(J);}
+    {@result=groebner(J);}
 
   if((size(I)!=0) && (size(J)-size(I)>=1))
@@ -158 +158 @@
       qring Q=I;
       ideal J=fetch(br,J);
-      J=std(J);
+      J=groebner(J);
       setring br;
       Res=fetch(Q,J);// Res contains the generators that we add to I
@@ -188 +188 @@
   if(b!=0)
     {
-      I=reduce(I,std(0));
-      J=reduce(J,std(0));
+      I=reduce(I,groebner(0));
+      J=reduce(J,groebner(0));
     }
 
@@ -214 +214 @@
       //================create a new ring with extra variables==============
 
-      execute("ring R1="+charstr(R)+",("+varstr(R)+",y((ii+1)..(ii+jj))),(dp(n),dp(kk+jj-n));");
+      execute("ring R1="+charstr(R)+",("+varstr(R)+",@y((ii+1)..(ii+jj))),(dp(n),dp(kk+jj-n));");
       ideal kern1;
       ideal A=fetch(R,A);
@@ -288 +288 @@
   if(b !=0) //means that the basering is a quotient ring
     {
-      p=reduce(p,std(0));
-      dom=reduce(dom,std(0));
+      p=reduce(p,groebner(0));
+      dom=reduce(groebner,std(0));
     }
 
@@ -359 +359 @@
      if(choose==2)
        {
-         ideal kern= nselect(std(dom),1,n);//"nselect" is combinatorial command
+         ideal kern= nselect(groebner(dom),1,n);//"nselect" is combinatorial command
                                          //which uses the internal command
                                         // "simplify"