Changeset 95edd5 in git

Timestamp:

Jan 14, 2009, 5:06:46 PM (14 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')

Children:

7f3ad4194490497ddcc8b5400f0f38119943ffb9

Parents:

041cc4437735050394650a0a060d20e2ee0cd5f5

Message:

*hannes: GMGs changes


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

File:

• Singular/LIB/standard.lib (modified) (36 diffs)

Singular/LIB/standard.lib

@@ -1 +1 @@
 //////////////////////////////////////////////////////////////////////////////
-//major revision Jan/Feb. 2007, GMG
-//groebner mit Optionen versehen
+//major revision Jan/Feb. 2007, GMG (groebner with several options)
+//Change of default methods in groebner (June 2008, GMG)
+//stdhilb can be called with std or slimgb (Jan 2008, GMG)
+//### Todo: im lokalen Fall die Hilbert-Samuel Funktion verwenden
 //////////////////////////////////////////////////////////////////////////////
-version="$Id: standard.lib,v 1.103 2008-12-18 15:45:21 Singular Exp $";
+version="$Id: standard.lib,v 1.104 2009-01-14 16:06:46 Singular Exp $";
 category="Miscellaneous";
 info="
@@ -18 +20 @@
  weightKB(stc,dd,vl)    degree dd part of a kbase wrt. some weigths
  qslimgb(i)             computes a standard basis with slimgb in a qring
- par2varRing([i])       create a ring with pars to vars together with i
+ par2varRing([i])       create a ring making pars to vars, together with i
+
 ";
-// hilbRing([i])          create a ring containing the homogenized i
-// quotientList(L,...)    a list, say QL, s.t. ring(QL) creates a correct qring
+//AUXILIARY PROCEDURES:
+// hilbRing([i])          ring for computing the (weighted) hilbert series
+// quotientList(L,...)    ringlist for creating a correct quotient ring
 
 //////////////////////////////////////////////////////////////////////////////
@@ -150 +154 @@
 "SYNTAX: @code{stdhilb (} ideal_expression @code{)} @*
          @code{stdhilb (} module_expression @code{)} @*
-         @code{stdhilb (} ideal_expression@code{,} intvec_expression @code{)}
-         @code{stdhilb (} ideal_expression@code{,} list of string_expressions
-               and intvec_expressin @code{)} @*
+         @code{stdhilb (} ideal_expression, intvec_expression @code{)}@*
+         @code{stdhilb (} module_expression, intvec_expression @code{)}@*
+         @code{stdhilb (} ideal_expression@code{,} list of string_expressions,
+               and intvec_expression @code{)} @*
 TYPE:    type of the first argument
 PURPOSE: Compute a Groebner basis of the ideal/module in the basering by
@@ -158 +163 @@
          If an argument of type string @code{\"std\"} resp. @code{\"slimgb\"}
          is given, the standard basis computation uses @code{std} or
-         @code{slimgb}, otherwise a heuristically chosen method (default)
+         @code{slimgb}, otherwise a heuristically chosen method (default)@*
+         If an optional second argument w of type intvec is given, w is used
+         as variable weights. If w is not given, it is computed as w[i] =
+         deg(var(i)). If the ideal is homogeneous w.r.t. w then the
+         Hilbert series is computed w.r.t. to these weights.
 THEORY:  If the ideal is not homogeneous compute first a Groebner basis
-         of the homogenization of the ideal, then the Hilbert function and,
-         finally, a Groebner basis in the original ring by using the
-         computed Hilbert function.@*
-         If the ideal is homogeneous and a second argument of type intvec
-         is given it will be used as 1st Hilbert function in the Hilbert
-         driven algorithm.
+         of the homogenization [w.r.t. the weights w] of the ideal/module,
+         then the Hilbert function and, finally, a Groebner basis in the
+         original ring by using the computed Hilbert function. If the given
+         w does not coincide with the variable weights of the basering, the
+         result may not be a groebner basis in the original ring.
 NOTE:    'homogeneous' means weighted homogeneous with respect to the weights
          w[i] of the variables var(i) of the basering. Parameters are not
          converted to variables.
-ASSUME:  The argument of type intvec is the 1st Hilbert series, computed
-         by @code{hilb} using an intvector w, w[i]=deg(var(i)), as third
-         argument
 SEE ALSO: stdfglm, std, slimgb, groebner
 KEYWORDS: Hilbert function
@@ -194 +199 @@
   string ordstr_P = ordstr(P);     //ordering of basering as string
   int nvarP = nvars(P);
-  intvec w;                        //for ringweights of basering P
-  int k;
-  for(k=1;  k<=nvarP; k++)
-  {
-    w[k]=deg(var(k));
-  }
-  int neg=1-attrib (P,"global");
 
   //save options:
+  intvec gopt = option(get);
   int p_opt;
   string s_opt = option();
   if (find(s_opt, "prot"))  { p_opt = 1; }
 
-//--------------------- check the given method ---------------------------
+//-------------------- check the given method and weights ---------------------
+//Note: stdhilb is used in elim where it is applied to an elimination ordering
+//a(1..1,0..0),wp(w). In such a ring deg(var(k)=0 for all vars corresponding to
+//0 in a(1..1,0..0), hence we cannot identify w via w[k] = deg(var(k));
+//Therefore hilbstd has the option to give ringweights.
+
+  int k;
   string method;
   for (k=1; k<=size(#); k++)
@@ -213 +218 @@
     if (typeof(#[k]) == "intvec")
     {
-      intvec hi = #[k];
+        intvec w = #[k];         //given ringweights of basering P
     }
     if (typeof(#[k]) == "string")
@@ -220 +225 @@
     }
   }
+
+  if ( defined(w)!=voice )
+  {
+    intvec w;
+    for(k=1;  k<=nvarP; k++)
+    {
+       w[k] = deg(var(k));     //compute ring weights
+    }
+  }
+
 
   if (npars(P) > 0)             //clear denominators of parameters
@@ -232 +247 @@
 //Note that quotient ideal of qring must be homogeneous too
 
-  if( find(ordstr_P,"s") || find(ordstr_P,"M")
-      || find(ordstr_P,"a") || (neg > 0) )
-  {
-    if( defined(hi) && is_homog )
-    {
-      if (p_opt){"std with given Hilbert function in basering";}
-      return( std(i,hi,w) );
-    }
-    if (p_opt){"//--stdhilb not implemented, use std in basering";}
-    //if ( neg )
-    //{
-    //  "//*** WARNING: non-positive ring weights, computation may not finish";
-    //}
+  int neg;
+  for ( k=1; k<=nvarP; k++)
+  {
+     if( var(k) < 1)
+     { neg = 1; }
+  }
+
+  if( find(ordstr_P,"s") || find(ordstr_P,"M") || (neg > 0) )
+  {
+    // if( defined(hi) && is_homog )
+    // {
+    //  if (p_opt){"std with given Hilbert function in basering";}
+    //  return( std(i,hi,w) );
+    //### here we would need Hibert-Samuel function
+    // }
+
+    if (p_opt)
+    {"//-- stdhilb not implemented, we use std in ring:"; string(P);}
     return( std(i) );
   }
 
 //------------------------ change to hilbRing ----------------------------
-
-  list hiRi = hilbRing(i);  //The ground field of P and Philb coincide
-  intvec W = hiRi[2];       //Philb has an extra variable @ or @(k)
-  def Philb = hiRi[1];      //Philb is no qring and the predefined
-  setring Philb;            //ideal/module Id(1) in Philb is homogeneous
-                            //Parameters of P are not converted in Philb
-//-------- compute Hilbert function of homogenized ideal in Philb ---------
-//Philb has only 1 block. There are three cases
+//The ground field of P and Philb coincide, Philb has an extra variable
+//@ or @(k). Philb is no qring and the predefined ideal/module Id(1) in
+//Philb is homogeneous (it is the homogenized i w.r.t. @ or @(k))
+//Parameters of P are not converted in Philb
+//Philb has only 1 block dp or wp(w)
+
+  list hiRi = hilbRing(i,w);
+  intvec W = hiRi[2];
+  def Philb = hiRi[1];
+  setring Philb;
+
+//-------- compute Hilbert series of homogenized ideal in Philb ---------
+//There are three cases
 
   string algorithm;       //possibilities: std, slimgb, stdorslimgb
@@ -274 +299 @@
   }
 
+//### geaendert Dez08: es wird std(Id(1)) statt Id(1) aus Philb nach Phelp
+// weitergegeben fuer hilbertgetriebenen std
+
   if (( algorithm=="std" || ( algorithm=="stdorslimgb" && char(P)>0 ) )
   && (defined(hi)!=voice))
   {
-    if (p_opt) {"std in ring " + string(Philb);}
-    intvec hi = hilb( std(Id(1)),1,W );
+    if (p_opt) {"compute hilbert series with std in ring " + string(Philb);
+                "weights used for hilbert series:",W;}
+    Id(1) = std(Id(1));
+    intvec hi = hilb( Id(1),1,W );
   }
   if (( algorithm=="slimgb" || ( algorithm=="stdorslimgb" && char(P)==0 ) )
   && (defined(hi)!=voice))
   {
-    intvec hi = hilb(qslimgb(Id(1)),1,W);
+    if (p_opt) {"compute hilbert series with slimgb in ring " + string(Philb);
+                "weights used for hilbert series:",W;}
+    Id(1) = qslimgb(Id(1));
+    intvec hi = hilb( Id(1),1,W );
   }
 
   //-------------- we need another intermediate ring Phelp ----------------
-  //In Phelp we change the ordering from Philb, otherwise it coincides with
-  //Philb, that is, it has in addition to P an extra homogenizing variable
-  //with name @, resp. @(i) if @ and @(1), ..., @(i-1) are defined.
+  //In Phelp we change only the ordering from Philb (otherwise it coincides
+  //with Philb). Phelp has in addition to P an extra homogenizing variable
+  //with name @ (resp. @(i) if @ and @(1), ..., @(i-1) are defined) with
+  //ordering an extra last block dp(1).
   //Phelp has the same ordering as P on common variables. In Phelp
   //a quotient ideal from P is added to the input
@@ -309 +343 @@
   w = w,1;
 
-  if( defined(moduleord) )
+  if( defined(moduleord)==voice )
   {
     BRlist[3][so+2] = moduleord;
   }
 
-//------ change to extended ring and compute std with hilbert series ------
+//--- change to extended ring Phelp and compute std with hilbert series ----
   def Phelp = ring(quotientList(BRlist));
   setring Phelp;
@@ -321 +355 @@
 
   // compute std with Hilbert series
-  if (w ==1)
+  option(redThrough);
+  if (w == 1)
   {
     if (p_opt){ "std with hilb in " + string(Phelp);}
@@ -346 +381 @@
   i = imap(Phelp,i);
   kill Phelp;
-  if( was_qring)
+  if( was_qring )
   {
     i = NF(i,std(0));
   }
   i = simplify(i,34);
-
   // compute reduced SB
   if (find(s_opt, "redSB") > 0)
@@ -359 +393 @@
   }
   attrib(i, "isSB", 1);
+  option(set,gopt);
   return (i);
 }
@@ -373 +408 @@
    intvec v = hilb(std(i),1);
    ideal j1 = std(i,v,intvec(3,2,1)); j1;
+
    size(NF(j,j1))+size(NF(j1,j));            //j and j1 define the same ideal
 }
@@ -546 +582 @@
 //////////////////////////////////////////////////////////////////////////////
 proc hilbRing ( list # )
-"USAGE:   hilbRing([l]); l list of ideals/modules [default:l=empty list]
+"USAGE:   hilbRing([w,l]); w = intvec, l = list of ideals/modules
 RETURN:  list, say L: L[1] is a ring and L[2] an intvec
          L[1] is a ring whith an extra homogenizing variable with name @,
          resp. @(i) if @ and @(1), ..., @(i-1) are defined.
-         The monomial ordering of L[1] is 1 block dp if the
+         The monomial ordering of L[1] is consists of 1 block: dp if the
          weights of the variables of the basering, say R, are all 1, resp.
-         wp(w,1) wehre w is the intvec of weights of the variables of R.
+         wp(w,1) wehre w is either given or the intvec of weights of the
+         variables of R, i.e. w[k]=deg(var(k)).
          If R is a quotient ring P/Q, then L[1] is not a quotient ring but
          contains the ideal @Qidealhilb@, the homogenized ideal Q of P.
          (Parameters of R are not touched).
-         If a list l is given with l[i] an ideal, then l[i] is
-         mapped to the homogenized ideal Id(i) in L[1].
-         L[2] is the intvec (w,1)
+         If a list l is given with l[i] an ideal/module, then l[i] is mapped
+         to Id(i), the homogenized l[i]+Q*freemodule(nrows(l[i]) in L[1]
+         (Id(i) = l[i] if l[i] is already homogeneous).
+         L[2] is the intvec (w,1).
 PURPOSE: Prepare a ring for computing the (weighted) hilbert series of
-         an ideal with an easy monomial ordering.
+         an ideal/module with an easy monomial ordering.
+NOTE:    For this purpose we need w[k]=deg(var(k)). However, if the ordering
+         contains an extra weight vector a(v,0..0)) deg(var(k)) returns 0 for
+         k being an index which is 0 in a. Therefore we must compute w
+         beforehand and give it to hilbRing.
 EXAMPLE: example hilbRing; shows an example
 "
@@ -571 +613 @@
   }
   list BRlist = ringlist(P);
-  BRlist[4] = ideal(0);
+  BRlist[4] = ideal(0);      //kill quotient ideal in BRlist
 
   int nvarP = nvars(P);
   int s = size(#);
-  intvec w;                   //for ringweights of basering P
   int k;
-  for(k=1;  k<=nvarP; k++)
-  {
-    w[k]=deg(var(k));
-  }
 
   for(k = 1; k <= s; k++)
   {
-    def Id(k) = #[k];
-    if (typeof(Id(k))=="module")
-    {
-      int nr(k) = nrows(Id(k));
-    }
-  }
-
-  // a homogenizing variable is added:
+    if ( typeof(#[k]) == "intvec" )
+    {
+       intvec w = #[k];      //given weights for the variables
+       # = delete (#,k);
+    }
+  }
+
+  s = size(#);
+  for(k = 1; k <= s; k++)
+  {
+     def Id(k) = #[k];
+     int nr(k) = nrows(Id(k));
+  }
+
+  if ( defined(w)!=voice )
+  {
+    intvec w;                   //for ringweights of basering P
+    for(k=1;  k<=nvarP; k++)
+    {
+      w[k]=deg(var(k));        //degree of kth variable
+    }
+  }
+  //--------------------- a homogenizing variable is added ------------------
   // call it @, resp. @(k) if @(1),...,@(k-1) are defined
   string homvar;
@@ -615 +667 @@
 
   BRlist[3] = list();
-  BRlist[3][2]=list("C",intvec(0));
+  BRlist[3][2]=list("C",intvec(0));  //put module ordering always last
   if(w==1)
   {
@@ -625 +677 @@
   }
 
-  //change ring and get ideal from previous ring
+  //-------------- change ring and get ideal from previous ring ---------------
   def Philb = ring(quotientList(BRlist));
   kill BRlist;
   setring Philb;
-  if( defined(is_qring) )
-  {
-    ideal @Qidealhilb@ =  homog( imap(P,Qideal), `homvar` );
+  if( defined(is_qring)==voice )
+  {
+    ideal @Qidealhilb@ =  imap(P,Qideal);
+    if ( ! homog(@Qidealhilb@) )
+    {
+       @Qidealhilb@ =  homog( @Qidealhilb@, `homvar` );
+    }
     export(@Qidealhilb@);
 
     if( find(option(),"prot") ){"add quotient ideal to input";}
+
     for(k = 1; k <= s; k++)
-    {  //homogenize
-      def Id(k) =  homog( imap(P,Id(k)), `homvar` );
+    { //homogenize if necessary
+      def Id(k) =  imap(P,Id(k));
+      if ( ! homog(Id(k)) )
+      {
+         Id(k) =  homog( imap(P,Id(k)), `homvar` );
+      }
       if (typeof(Id(k))=="module")
       {
@@ -652 +713 @@
   {
     for(k = 1; k <= s; k++)
-    { //homogenize
-      def Id(k) =  homog( imap(P,Id(k)), `homvar` );
+    { //homogenize if  necessary
+      def Id(k) =  imap(P,Id(k));
+      if ( ! homog(Id(k)) )
+      {
+         Id(k) =  homog( imap(P,Id(k)), `homvar` );
+      }
       export(Id(k));
     }
@@ -664 +729 @@
    ring R = 0,(x,y,z,u,v),lp;
    ideal i = x+y2+z3,xy+xv+yz+zu+uv,xyzuv-1;
-   def P = hilbRing(i)[1];  P;
+   intvec w = 6,3,2,1,1;
+   hilbRing(i,w);
+   def P = hilbRing(w,i)[1];
    setring P;
    Id(1);
@@ -791 +858 @@
 {
 //Vorgabe einer Teilmenge aus {hilb,fglm,par2var,std,slimgb}
-//Aktuelle Einstellungen (Jan 2007):
+//V1: Erste Einstellungen (Jan 2007)
+//V2: Aktuelle Aenderungen (Juni 2008)
 //---------------------------------
 //0. Immer Aufruf von std unabhaengig von der Vorgabe:
 //   gemischte Ordnungen, extra Gewichtsvektor, Matrix Ordnungen
+//   ### Todo: extra Gewichtsvektor sollte nicht immer mit std wirken,
+//   sondern z.B. mit "hilb" arbeiten koennen
+//   ### Todo: es sollte ein Gewichtsvektor mitgegeben werden koennen (oder
+//   berechnet werden), z.B. groebner(I,"hilb",w) oder groebner(I,"withWeights")
+//   wie bei elim in elim.lib
 
 //1. Keine Vorgabe: es wirkt die aktuelle Heuristk:
-//   - Char p: std
-//   - Char = 0: slimgb (im qring wird Quotientenideal zum Input addiert)
+//   - Char = p: std
+//V1 - Char = 0: slimgb (im qring wird Quotientenideal zum Input addiert)
+//V2 - Char = 0: std
 //   - 1-Block-Ordnungen/non-commutative: direkt Aufruf von std oder slimgb
 //   - Komplizierte Ordnungen (lp oder > 1 Block): hilb
-//   - Parameter werden grundsaetzlich nicht in Variable umgewandelt
-//   ? alternativ: more than 1 parameter will be converted to ring variable ?
+//V1 - Parameter werden grundsaetzlich nicht in Variable umgewandelt
+//V2 - Mehr als ein Parmeter wird zu Variable konvertiert
 //   - fglm is keine Heuristik, da sonst vorher dim==0 peprueft werden muss
 
-//2. Vorgabe aus {std,slimgb}: es wird wo immer moeglich das angegebene
+//2. Vorgabe aus {std,slimgb}: es wird wo immer moeglich das Angegebene
 //   gewaehlt (da slimgb keine Hilbertfunktion kennt, wird std verwendet).
 //   Bei slimgb im qring, wird das Quotientenideal zum Ideal addiert.
@@ -812 +886 @@
 
 //3. Nichtleere Vorgabe aus {hilb,fglm,std,slimgb}:
-//   es wird nur das angegebene und moegliche sowie das notwendige verwendet
+//   es wird nur das Angegebene und Moegliche sowie das Notwendige verwendet
 //   und bei Wahlmoeglickeit je nach Heuristik.
 //   Z.B. Vorgabe von {hilb} ist aequivalent zu {hilb,std,slimgb} und es wird
-//   hilb und nach Heuristik std oder slimgb verwendet, aber nicht par2var;
+//   hilb und nach Heuristik std oder slimgb verwendet,
+//   (V1: aber nicht par2var)
 //   bei Vorgabe von {hilb,slimgb} wird hilb und wo moeglich slimgb verwendet.
 
@@ -829 +904 @@
 
 //----------------------- save the given method ---------------------------
-  string method;
-  list Method;
+  string method;                //all given methods as a coma separated string
+  list Method;                  //all given methods as a list
   int k;
   for (k=1; k<=size(#); k++)
@@ -890 +965 @@
             kill PP;
           }
-          if (defined(groebner_error))
+          if (defined(groebner_error)==1)
           {
             kill groebner_error;
@@ -934 +1009 @@
      //is_homog = homog(Qideal); //remembers if Qideal was homog (homog(0)=1)
   }
-  list BRlist = ringlist(P);
+  list BRlist = ringlist(P);     //ringlist of basering
 
   // save ordering of basering P for later use
@@ -956 +1031 @@
 //------------------ cases where std is always used ------------------------
 //If other methods are not implemented or do not make sense, i.e. for
-//local or mixed orderings, matrix orderings, extra weight vector and modules
+//local or mixed orderings, matrix orderings, extra weight vector
+//### Todo: extra weight vector should be allowed for e.g. with "hilb"
 
   if(  //( find(ordstr_P,"s") > 0 ) || // covered by neg
-       ( find(ordstr_P,"M") > 0 )
-    || ( find(ordstr_P,"a") > 0 )
-    || ( neg>0 ) )
+       ( find(ordstr_P,"M") > 0 )  || ( find(ordstr_P,"a") > 0 )  || ( neg>0 ) )
   {
     if (p_opt) { "std in basering"; }
@@ -1012 +1086 @@
 
   //define partovar:
-  if( find(method,"par2var") && npars_P > 0 )
+  //if( find(method,"par2var") && npars_P > 0 )   //V1
+  if( find(method,"par2var") || npars_P > 1 )     //V2
   {
      partovar = "yes";
@@ -1055 +1130 @@
   //conversion (fglm or hilb) is specified and if the parameters shall
   //not be made to variables
-
+  //BRlist (=ringlist of basering) > 4 if the basering is non-commutative
 //---------------------------- direct methods -----------------------------
   if ( direct == "yes" )
   {
-    if ( algorithm=="std" || (algorithm=="stdorslimgb" && char(P)>0) )
+  //if ( algorithm=="std" || (algorithm=="stdorslimgb" && char(P)>0) )   //V1
+    if ( algorithm=="std" || (algorithm=="stdorslimgb") )                //V2
     {
       if (p_opt) { "std in " + string(P); }
       return(std(i));
     }
-    if ( algorithm=="slimgb" || (algorithm=="stdorslimgb" && char(P)==0) )
+  //if( algorithm=="slimgb" || (algorithm=="stdorslimgb" && char(P)==0)) //V1
+    if ( algorithm=="slimgb" )                                           //V2
     {
       return(qslimgb(i));
@@ -1075 +1152 @@
 //direct=="no" (i.e. "hilb" or "fglm" or "par2var" is given)
 //or no method is given and we have a complicated monomial ordering
-//Note thar "par2var" is not a default strategy, it must be explicitely
+//V1: "par2var" is not a default strategy, it must be explicitely
 //given in order to be performed.
+//V2: "par2var" is a default strategy if there are more than 1 parameters
 
 //------------ case where no parameters are made to variables  -------------
@@ -1087 +1165 @@
     if ( conversion=="fglm" )
     {
-      if ( algorithm=="std" || (algorithm=="stdorslimgb" && char(P)>0) )
+    //if ( algorithm=="std" || (algorithm=="stdorslimgb" && char(P)>0) ) //V1
+      if ( algorithm=="std" || (algorithm=="stdorslimgb") )              //V2
       {
         return (stdfglm(i,"std"));
       }
-      if ( algorithm=="slimgb" || (algorithm=="stdorslimgb" && char(P)==0) )
+    //if(algorithm=="slimgb" || (algorithm=="stdorslimgb" && char(P)==0))//V1
+      if( algorithm=="slimgb" )                                          //V2
       {
         return (stdfglm(i,"slimgb"));
@@ -1098 +1178 @@
     else
     {
-      if ( algorithm=="std" || (algorithm=="stdorslimgb" && char(P)>0) )
+    //if ( algorithm=="std" || (algorithm=="stdorslimgb" && char(P)>0) )//V1
+      if ( algorithm=="std" || (algorithm=="stdorslimgb" ) )            //V2
       {
         return (stdhilb(i,"std"));
       }
-      if ( algorithm=="slimgb" || (algorithm=="stdorslimgb" && char(P)==0) )
+    //if(algorithm=="slimgb" || (algorithm=="stdorslimgb" && char(P)==0))//V1
+      if ( algorithm=="slimgb" )                                         //V2
       {
         return (stdhilb(i,"slimgb"));
@@ -1146 +1228 @@
     else
     {
-      if ( algorithm=="std" || (algorithm=="stdorslimgb" && char(P)>0) )
+    //if ( algorithm=="std" || (algorithm=="stdorslimgb" && char(P)>0) )//V1
+      if ( algorithm=="std" || (algorithm=="stdorslimgb" ))             //V2
       {
         i = stdhilb(i,"std");
       }
-      if ( algorithm=="slimgb" || (algorithm=="stdorslimgb" && char(P)==0) )
+    //if(algorithm=="slimgb" || (algorithm=="stdorslimgb" && char(P)==0))//V1
+      if ( algorithm=="slimgb" )                                         //V2
       {
         i = stdhilb(i,"slimgb");
@@ -1159 +1243 @@
 //-------------------- go back to original ring ---------------------------
 //The main computation is done. However, the SB coming from a ring with
-//extra variables is in general too big. We simplify it befor mapping it
+//extra variables is in general too big. We simplify it before mapping it
 //to the basering.
 
@@ -2073 +2157 @@
   weightKB(i, 12, list(w));
 }
-//////////////////////////////////////////////////////////////////////////////
-
+
+///////////////////////////////////////////////////////////////////////////////
 /*
-Versuche:
+                                Versuche:
 ///////////////////////////////////////////////////////////////////////////////
 proc downsizeSB (I, list #)
@@ -2226 +2310 @@
 }
 ///////////////////////////////////////////////////////////////////////////////
-//die folgende proc war fuer groebner mit fglm vorgesehen
-//um die projektive Dimension korrekt zu berechnen, muss man aber
+//die folgende proc war fuer groebner mit fglm vorgesehen, ist aber zu teuer.
+//Um die projektive Dimension korrekt zu berechnen, muss man aber teuer
 //voerher ein SB bzgl. einer Gradordnung berechnen und dann homogenisieren.
 //Sonst koennen hoeherdimensionale Komponenten in Unendlich entstehen
@@ -2343 +2427 @@
 
 */
-
+///////////////////////////////////////////////////////////////////////////////
+//                           EXAMPLES
+///////////////////////////////////////////////////////////////////////////////
+/*
+example stdfglm;
+example stdhilb;
+example groebner;
+example res;
+example sprintf;
+example fprintf;
+example printf;
+example weightKB;
+example qslimgb;
+example par2varRing;
+*/