Changeset db347cb in git for Singular/LIB/algebra.lib

Timestamp:

Oct 6, 2012, 1:02:39 PM (12 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

95197e27d1277756b09bcdadc0b4e418cd280274

Parents:

20c54056198f825ef62888512342886cf96c82a6

git-author:

Hans Schoenemann <hannes@mathematik.uni-kl.de>2012-10-06 13:02:39+02:00

git-committer:

Hans Schoenemann <hannes@mathematik.uni-kl.de>2012-10-06 13:03:40+02:00

Message:

fix from master: exceptional cases (algebra.lib), rename sum (modstd.lib)

File:

• Singular/LIB/algebra.lib (modified) (5 diffs)

Singular/LIB/algebra.lib

@@ -3 +3 @@
 //new proc  nonZeroEntry(id), used to fix a bug in proc finitenessTest
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id$";
+version="$Id: algebra.lib 14661 2012-03-05 11:00:14Z motsak $";
 category="Commutative Algebra";
 info="
@@ -329 +329 @@
 @end format
 NOTE:    Three different algorithms are used depending on c = 1,2,3.
-         If c is not given or c=0, a heuristically best method is choosen.
+         If c is not given or c=0, a heuristically best method is chosen.
          The basering may be a quotient ring.
          To access to the ring l[2] and see ker you must give the ring a name,
@@ -532 +532 @@
 @end format
 NOTE:    Three differnt algorithms are used depending on c = 1,2,3.
-         If c is not given or c=0, a heuristically best method is choosen.
+         If c is not given or c=0, a heuristically best method is chosen.
          The basering may be a quotient ring. However, if the preimage ring is
          a quotient ring, say pr = P/I, consider phi as a map from P and then
@@ -799 +799 @@
 "
 {
-   if ( deg(i[1]) <= 0)
-   {
-     list l = ideal(0),i;
+   i=simplify(i,2);
+   if ( i== 0)
+   {
+     list l = maxideal(1),maxideal(1);
      return( l );
    }
@@ -821 +822 @@
    i = j[2];
    int d = dim(j[1]);
-   if ( d == 0)
+   if ( d <= 0)
    {
      setring r;
-     list l = ideal(0),maxideal(1);
+     list l = maxideal(1),ideal(0);
      return( l );
    }