Changeset 367e88 in git for Singular/LIB/primdec.lib

Timestamp:

Feb 21, 2001, 11:08:16 AM (23 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

ae545ac63ed4198e2445854403c6dbf0dd6ff599

Parents:

634c98b2990bf86e590986643d68ee13f3fc09b2

Message:

* hannes: interred


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

File:

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

Singular/LIB/primdec.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: primdec.lib,v 1.97 2001-02-20 09:43:07 pfister Exp $";
+version="$Id: primdec.lib,v 1.98 2001-02-21 10:08:16 Singular Exp $";
 category="Commutative Algebra";
 info="
@@ -10 +10 @@
 OVERVIEW:
     Algorithms for primary decomposition based on the ideas of
-    Gianni, Trager and Zacharias (implementation by Gerhard Pfister), 
-    respectively based on the ideas of Shimoyama and Yokoyama (implementation 
+    Gianni, Trager and Zacharias (implementation by Gerhard Pfister),
+    respectively based on the ideas of Shimoyama and Yokoyama (implementation
     by Wolfram Decker and Hans Schoenemann).
  @* The procedures are implemented to be used in characteristic 0.
@@ -1643 +1643 @@
    {
       execute ("ring gnir=("+charstr(P)+"),("+varstr(P)+"),lp;");
-      
+
       list p=facstd(fetch(P,i));
       if(size(p)>1)
@@ -1757 +1757 @@
         - a[s] the equidimensional locus of i, i.e. the intersection
           of the primary ideals of dimension of i
-        - a[1],...,a[s-1] the lower dimensional equidimensional loci.  
-NOTE:    An embedded component q (primary ideal) of i can be replaced in the 
+        - a[1],...,a[s-1] the lower dimensional equidimensional loci.
+NOTE:    An embedded component q (primary ideal) of i can be replaced in the
          decomposition by a primary ideal q1 with the same radical as q. @*
          @code{equidim(i,1)} uses the algorithm of Eisenbud/Huneke/Vasconcelos.
@@ -4383 +4383 @@
 "USAGE:   primdecGTZ(i); i ideal
 RETURN:  a list pr of primary ideals and their associated primes:
-@format   
+@format
    pr[i][1]   the i-th primary component,
    pr[i][2]   the i-th prime component.
@@ -4415 +4415 @@
 "USAGE:   primdecSY(i); i ideal, c int
 RETURN:  a list pr of primary ideals and their associated primes:
-@format   
+@format
    pr[i][1]   the i-th primary component,
    pr[i][2]   the i-th prime component.
@@ -4471 +4471 @@
       return(minAssPrimes(i,1));
    }
-   return(minAssPrimes(i));   
+   return(minAssPrimes(i));
 }
 example
@@ -4717 +4717 @@
 RETURN:  list of primary ideals, the zero-dimensional decomposition of I
 NOTE:    The algorithm (of Monico), works well only for a small total number
-         of solutions (@code{vdim(std(I))} should be < 100) and without 
-         parameters. In practice, it works also in large characteristic p>0 
+         of solutions (@code{vdim(std(I))} should be < 100) and without
+         parameters. In practice, it works also in large characteristic p>0
          but may fail for small p.
 @*       If printlevel > 0 (default = 0) additional information is displayed.
@@ -4969 +4969 @@
 time=timer; ideal ra =radical(gls); timer-time;size(pr);
 */
-
-
-