Changeset 13fdeb in git for Singular

Timestamp:

Jan 27, 2007, 4:03:55 PM (17 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', '4bd32dfef92ec9f5ed8dceee82d14318ae147107')

Children:

4d2f7f8cb055b760bceff7f6c2c2b9024e2ee175

Parents:

724bb08fec87e2a03469244f7f07c731354fe49b

Message:

*hannes: fix list assignments


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

File:

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

Singular/LIB/finvar.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: finvar.lib,v 1.55 2007-01-26 09:29:25 king Exp $"
+version="$Id: finvar.lib,v 1.56 2007-01-27 15:03:55 Singular Exp $"
 category="Invariant theory";
 info="
@@ -4712 +4712 @@
       if (int(dimmat[i,1])<>counter)   // need more than all the power products
       { if (v)
-        { "There are irreducible secondary invariants in degree ", i-1," !!";
+        { "There are irreducible secondary invariants in degree ", i-1," !";
         }
         if (i>IrrSwitch)  // use sparse algorithm
@@ -5150 +5150 @@
       if (int(dimmat[i,1])<>counter)   // need more than all the power products
       { if (v)
-        { "There are irreducible secondary invariants in degree ", i-1," !!";
+        { "There are irreducible secondary invariants in degree ", i-1," !";
         }
         if (i>IrrSwitch)  // use sparse algorithm
@@ -5825 +5825 @@
       if (deg_dim_vec[i]<>counter)   // need more than all the power products
       { if (v)
-        { "There are irreducible secondary invariants in degree ", i-1," !!";
+        { "There are irreducible secondary invariants in degree ", i-1," !";
         }
         if (i>IrrSwitch)  // use sparse algorithm
@@ -6147 +6147 @@
         { if ((j mod MonStep) == 0) 
           { if ((j+MonStep) <= ii)
-            { B[j+1..j+MonStep] = normalize(evaluate_reynolds(REY,ideal(mon[j+1..j+MonStep])));
-              ReducedCandidates[j+1..j+MonStep] = reduce(ideal(B[j+1..j+MonStep]),sP);
-              Indicator[j+1..j+MonStep] = reduce(ideal(ReducedCandidates[j+1..j+MonStep]),SaveRed);
+            { ideal tmp = normalize(evaluate_reynolds(REY,ideal(mon[j+1..j+MonStep])));
+              B[j+1..j+MonStep] = tmp[1..MonStep];
+              tmp = reduce(ideal(B[j+1..j+MonStep]),sP);
+              ReducedCandidates[j+1..j+MonStep] = tmp[1..MonStep];
+              tmp = reduce(ideal(ReducedCandidates[j+1..j+MonStep]),SaveRed);
+              Indicator[j+1..j+MonStep] = tmp[1..MonStep];
+              kill tmp;
             }
             else
-            { B[j+1..ncols(mon)] = normalize(evaluate_reynolds(REY,ideal(mon[j+1..ncols(mon)])));
-              ReducedCandidates[j+1..ncols(mon)] = reduce(ideal(B[j+1..ncols(mon)]),sP);
-              Indicator[j+1..ncols(mon)] = reduce(ideal(ReducedCandidates[j+1..ncols(mon)]),SaveRed);
+            { ideal tmp = normalize(evaluate_reynolds(REY,ideal(mon[j+1..ncols(mon)])));
+              B[j+1..ncols(mon)] = tmp[1..ncols(mon)-j];
+              tmp = reduce(ideal(B[j+1..ncols(mon)]),sP);
+              ReducedCandidates[j+1..ncols(mon)] = tmp[1..ncols(mon)-j];
+              tmp = reduce(ideal(ReducedCandidates[j+1..ncols(mon)]),SaveRed);
+              Indicator[j+1..ncols(mon)] = tmp[1..ncols(mon)-j];
+              kill tmp;
             }
           } 
@@ -6163 +6171 @@
             S[counter] = B[j];
             if (v)
-            { "  We found"+string(counter)+" sec. inv. in degree"+string(i);
+            { "  We found "+string(counter)+" sec. inv. in degree "+string(i);
             }
             if (counter == max) {break;}