Changeset 35ceb0 in git

Timestamp:

May 4, 2005, 11:31:39 AM (18 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '91fdef05f09f54b8d58d92a472e9c4a43aa4656f')

Children:

9091d3c67d9cb6f17d3aec61f7c39d46db565862

Parents:

9a0cc7d25e77bedcb338c2ab32de3f3eefda109f

Message:

*pfister/lossen: fix


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

File:

• Singular/LIB/presolve.lib (modified) (7 diffs)

Singular/LIB/presolve.lib

@@ -1 +1 @@
 //last change: 13.02.2001 (Eric Westenberger)
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: presolve.lib,v 1.22 2005-05-02 11:53:42 Singular Exp $";
+version="$Id: presolve.lib,v 1.23 2005-05-04 09:31:39 Singular Exp $";
 category="Symbolic-numerical solving";
 info="
@@ -19 +19 @@
  tolessvars(id[,]);     maps id to new basering having only vars occuring in id
  solvelinearpart(id);   reduced std-basis of linear part of id
- sortandmap(id [..]);   map to new basering with vars sorted w.r.t. complexity
+ sortandmap(id[..]);   map to new basering with vars sorted w.r.t. complexity
  sortvars(id[n1,p1..]); sort vars w.r.t. complexity in id [different blocks]
  valvars(id[..]);       valuation of vars w.r.t. to their complexity in id
@@ -34 +34 @@
 LIB "ring.lib";
 LIB "elim.lib";
+///////////////////////////////////////////////////////////////////////////////
+proc shortid (id,int n,list #)
+"USAGE:   shortid(id,n[,e]); id= ideal/module, n,e=integers
+RETURN:  - if called with two arguments or e=0:
+@*       same type as id, containing generators of id having <= n terms.
+@*       - if called with three arguments and e!=0:
+@*       a list L:
+@*       L[1]: same type as id, containing generators of id having <= n terms.
+@*       L[2]: number of corresponding generator of id
+NOTE:    May be used to compute partial standard basis in case id is to hard
+EXAMPLE: example shortid; shows an example  
+"
+{
+  intvec v;
+  int ii;
+  for(ii=1; ii<=ncols(id); ii++)
+  {
+   if (size(id[ii]) <=n and id[ii]!=0 )
+   {
+     v=v,ii;
+   }
+   if (size(id[ii]) > n )
+   {
+       id[ii]=0;
+   }
+  }
+  if( size(v)>1 )
+  {  
+    v = v[2..size(v)];
+  }
+  id = simplify(id,2);
+  list L = id,v;
+  if ( size(#)==0 )
+  {
+    return(id);
+  }
+  if ( size(#)!=0 )
+  {
+    if(#[1]==0)
+    {
+      return(id);
+    }
+    if(#[1]!=0)
+    {
+      return(L);
+    }
+  }
+}
+example
+{ "EXAMPLE:"; echo = 2;
+   ring s=0,(x,y,z,w),dp;
+   ideal i = (x3+y2+yw2)^2,(xz+z2)^2,xyz-w2-xzw; 
+   shortid(i,3);
+}
 ///////////////////////////////////////////////////////////////////////////////
 
@@ -148 +202 @@
       }
    }
-   lin = simplify(lin,2);
+   lin = simplify(lin,3);
    attrib(lin,"isSB",1);
    ideal eva = lead(lin);
@@ -293 +347 @@
                   kin = simplify(phi(kin),2);
                   l = size(kin);
-                  ii=ii+1;
+                 // ii=ii+1;
                   break;
                }
@@ -321 +375 @@
       }
    }
-   L = lin, eva, sub, neva, phi;
+   map psi=P,phi;
+   ideal phi1=maxideal(1);
+   for(ii=1;ii<=size(eva);ii++){phi1=psi(phi1);}
+   L = lin, eva, sub, neva, phi1;
   return(L);
 }
@@ -1164 +1221 @@
 ///////////////////////////////////////////////////////////////////////////////
 proc idealSplit(ideal I,list #)
-"USAGE:  idealSplit(id,timeF,timeS);  id ideal and optioonal 
+"USAGE:  idealSplit(id,timeF,timeS);  id ideal and optional 
          timeF ,timeS integers to bound the time which can be used
          for factorization resp. standard basis computation