Changeset 1dc0144 in git for Singular

Timestamp:

Jul 6, 2022, 3:49:04 PM (22 months ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', '17f1d200f27c5bd38f5dfc6e8a0879242279d1d8')

Children:

c894d1ba0b692e54f6dddf08d4b09e06c446a8dc

Parents:

da3bc3a8b3c9da1c97db491be78d56461b87c72d

Message:

Wolrams comments to doc

File:

• Singular/LIB/integralbasis.lib (modified) (9 diffs)

Singular/LIB/integralbasis.lib

@@ -43 +43 @@
         - \"normal\" -> the integral basis is computed using the general
         normalization algorithm.@*
-        - \"hensel\" -> the integral bases is computed using an algorithm 
-        based on Puiseux expansions and Hensel lifting. (Default option.)
-        @*Options for normal algorithm:@*
-        - \"global\" -> computes the normalization of R / <f> and put the
+        - \"hensel\" -> the integral bases is computed using an algorithm
+        based on Puiseux expansions and Hensel lifting. (only available for
+        polynomials with rational coefficients; default option in that case)@*
+        Options for normal algorithm:@*
+        - \"global\" -> computes the normalization of R / <f> and puts the
         results in integral basis shape.@*
         - \"local\" -> computes the normalization at each component of
-        the singular locus of R/<f> and puts everything together. 
+        the singular locus of R/<f> and puts everything together.
         (Default option for normal algorithm.)
         @*Other options:@*
@@ -59 +60 @@
         - \"nonModular\" -> do not uses modular algorithms. (Default option for
         ground fields of positive charecteristic.)@*
-        - \"atOrigin\" -> will compute the local contribution at the origin
-        to the integral basis, assuming that the curve has a singularity at
-        the origin.@*
+        - \"atOrigin\" -> will compute the local contribution to the integral
+        basis at the origin only (naturally, this contribution is only relevant
+        if the curve defined by f has a singularity at the origin).@*
         - \"isIrred\" -> assumes that the input polynomial f is irreducible,
         and therefore will not check this. If this option is given but f is not
@@ -88 +89 @@
         the degree of f as a polynomial in y.@*
 THEORY:  We compute the integral basis of the integral closure of k[x] in k(x,y).
-         When option \"normal\" is selected, the normalization of the affine 
+         When option \"normal\" is selected, the normalization of the affine
          ring k[x,y]/<f> is computed using procedure normal from normal.lib,
          which implements a general algorithm for normalization of rings
-         by G. Greuel, S. Laplagne and F. Seelisch, and the k[x,y]-module 
+         by G. Greuel, S. Laplagne and F. Seelisch, and the k[x,y]-module
          generators are converted into a k[x]-basis.
-         When option \"Hensel\" is selected, the algorithm by J. Boehm, W. Decker, 
+         When option \"Hensel\" is selected, the algorithm by J. Boehm, W. Decker,
          S. Laplagne and G. Pfister is used. @*
 KEYWORDS: integral basis; normalization.
@@ -1265 +1266 @@
     list classesNew;
     list classesTemp;
-    
-    
+
+
     int clInd = 1;
-    
+
     for(i = 1; i <= size(I2Lifted)-1; i++)
     {
@@ -1374 +1375 @@
     "Maximum degree required for merging: ", mdm;
   }
-  
+
   list ifOut = irreducibleFactors(f, classes, blocks, mdm);
   list I2LiftedFull = ifOut[1];
-  
+
   // The classes are reordered in the same order as the irreducible factors
   classes = ifOut[5];
-  
+
   if((ifOut[4] == 1))  // Wrong number of factors, recompute orders
   {
@@ -3053 +3054 @@
     def R = basering;
     int blInd;
-    
+
     for(i = 2; i <= size(I2Lifted); i++)
     {
@@ -3063 +3064 @@
       newL = puiseux(I2Lifted[i], -1, 1);
       classes2 = getClasses(newL);
-      
+
       blInd = 1;
       for(j =1; j <= size(classes); j++)
@@ -3074 +3075 @@
       }
 
-      
+
       if(size(classes2) > 1)
       {
@@ -3145 +3146 @@
     wrongNumber = 1;
   }
-  list ll = list(I2Lifted, gfCheckList, gfCheck, wrongNumber, updatedClasses); 
+  list ll = list(I2Lifted, gfCheckList, gfCheck, wrongNumber, updatedClasses);
 
   return(ll);