Changeset 1d06d1 in git

Timestamp:

Nov 23, 2015, 6:27:29 PM (8 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

8b9677509f933f77764c8d3fae0cc62f8c9eb23f

Parents:

86f1dc12cedc9ed8fc9f2a65d0bacf9c38c027f96ba950e5cfaadf94bd8ecc90e29bc1fe2bbc7d3a

Message:

Merge pull request #736 from YueRen/graal_lib

chg: cleanup for next Singular release

File:

• Singular/LIB/graal.lib (modified) (6 diffs)

Singular/LIB/graal.lib

@@ -1 +1 @@
 ////////////////////////////////////////////////////////////////////////////
-version="version graal.lib 4.0.2.0 Apr_2015 "; // $Id$
+version="26.03.2015";
 category="Commutative Algebra";
 info="
@@ -12 +12 @@
 REFERENCES:
 Mora, Teo: La queste del Saint Gr_a(A_L): A computational approach to local algebra
-Marais, Magdaleen and Ren, Yue: Mora's holy grail, algorithms for computing in localizations at prime ideals
+Marais, Magdaleen and Ren, Yue: Mora's holy graal: Algorithms for computing in localizations at prime ideals
 
 PROCEDURES:
 graalMixed(ideal L);
 graalMixed(ideal L, int t);
-yinitial(poly f);
-yinitial(poly f, int s);
-yinitial(ideal I);
-yinitial(ideal I, int s);
-dimensionOfLocalization(ideal J);
-dimensionOfLocalization(graalBearer Gr);
-systemOfParametersOfLocalization(ideal L);
-systemOfParametersOfLocalization(graalBearer L);
-isLocalizationRegular(ideal L);
-isLocalizationRegular(graalBearer L);
+dimensionOfLocalization(def L);
+systemOfParametersOfLocalization(def L);
+isLocalizationRegular(def L);
 warkedPreimageStd(warkedModule wM);
-resolutionInLocalization(ideal I, ideal L);
-resolutionInLocalization(ideal I, graalBearer Gr);
+resolutionInLocalization(ideal I, def L);
 ";
 
@@ -116 +108 @@
 
 
-proc yinitial(def F, list #)
-"
-USAGE:    yinitial(F,s); F polynomial or ideal, s int (optional)
-RETURN:   if F polynomial, returns the sum over all terms of lowest degree in Y.
-          if F ideal, returns the yinitials of all its generators.
-          if s is specified, assumes that there are s variables in Y, Y(1),...,Y(s).
-NOTE:     assumes that the Y are the first variables in the basering and,
-          if s unspecified, that they have their own block in the ordering.
-EXAMPLE:  example yinitial; shows an example
-"
+static proc yinitial(def F, list #)
 {
   int s;
@@ -156 +139 @@
     return(inF);
   }
-}
-example
-{ "EXAMPLE:"; echo = 2;
-  // todo
 }
 
@@ -774 +753 @@
  * normalizes g such that LT_>(g)=Y^\alpha for some \alpha\in\NN^n.
  **/
-proc normalizeInY(vector g, graalBearer Gr, list #)
+static proc normalizeInY(vector g, graalBearer Gr, list #)
 {
   def origin = basering;
@@ -1228 +1207 @@
 }
 example
-{
+{ "EXAMPLE:"; echo = 2;
   ring Q = 0,(x,y,z,w),dp;
   ideal circle = (x-1)^2+y^2-3,z;