Changeset 640e4c in git

Timestamp:

Apr 8, 2011, 5:40:29 PM (13 years ago)

Author:

Burcin Erocal <burcin@…>

Branches:

(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'd08f5f0bb3329b8ca19f23b74cb1473686415c3a')

Children:

6dce0a2f79407a50343791008290059180184804

Parents:

0b301eb684d2361d4bbb42f05cd0cca8ee0ea520

Message:

Add new version of ncfactor.lib received from the authors on 29.03.2011.

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

Files:

• Singular/LIB/ncfactor.lib (modified) (25 diffs)
• Tst/Long/ncfactor_tsai_l.res.gz.uu (added)
• Tst/Long/ncfactor_tsai_l.stat (added)
• Tst/Long/ncfactor_tsai_l.tst (added)
• Tst/Long/ok_l.lst (modified) (1 diff)
• Tst/Short/ncfactor_example_all_procedures_s.res.gz.uu (added)
• Tst/Short/ncfactor_example_all_procedures_s.stat (added)
• Tst/Short/ncfactor_example_all_procedures_s.tst (added)
• Tst/Short/ncfactor_inhomog_s.res.gz.uu (added)
• Tst/Short/ncfactor_inhomog_s.stat (added)
• Tst/Short/ncfactor_inhomog_s.tst (added)
• Tst/Short/ok_s.lst (modified) (1 diff)

Singular/LIB/ncfactor.lib

@@ -20 +20 @@
 
 PROCEDURES:
-  facFirstWeyl(h);    factorization in the first Weyl algebra
-  testNCfac(l[,h]);   tests factorizations from a given list for correctness
-  facSubWeyl(h,X,D);  factorization in the first Weyl algebra as a subalgebra
-  facFirstShift(h);   factorization in the first shift algebra
+  facFirstWeyl(h);           factorization in the first Weyl algebra
+  testNCfac(l[,h[,1]]);      tests factorizations from a given list for correctness
+  facSubWeyl(h,X,D);         factorization in the first Weyl algebra as a subalgebra
+  facFirstShift(h);          factorization in the first shift algebra
+  homogfacFirstQWeyl(h);     [-1,1]-homogeneous factorization in the first Q-Weyl algebra
+  homogfacFirstQWeyl_all(h); [-1,1] homogeneous factorization(complete) in the first Q-Weyl algebra
 ";
 
@@ -30 +32 @@
 LIB "involut.lib";
 LIB "freegb.lib"; // for isVar
+
+proc tst_ncfactor()
+{
+  example facFirstWeyl;
+  example facFirstShift;
+  example facSubWeyl;
+  example testNCfac;
+  example homogfacFirstQWeyl;
+  example homogfacFirstQWeyl_all;
+}
 
 /////////////////////////////////////////////////////
@@ -945 +957 @@
 PURPOSE: compute all factorizations of a polynomial in the first Weyl algebra
 THEORY: Implements the new algorithm by A. Heinle and V. Levandovskyy, see the thesis of A. Heinle
-ASSUME: basering in the first Weyl algebra
+ASSUME: basering is the first Weyl algebra
 NOTE: Every entry of the output list is a list with factors for one possible factorization.
 The first factor is always a constant (1, if no nontrivial constant could be excluded).
@@ -1059 +1071 @@
   if(homogwithorder(h,ivm11))
   {
-    dbprint(p,"==> Given polynomial is -1,1 homogeneous. Starting homog. fac. and ret. its result");
+    dbprint(p,"==> Given polynomial is -1,1 homogeneous. Start homog. fac. and ret. its result");
     return(homogfacFirstWeyl_all(h));
   }
@@ -1097 +1109 @@
     {//We have one factorization
       result = result + list(M[i]);
+      dbprint(p,"Result list updated:");
+      dbprint(p,result);
       M = delete(M,i);
       continue;
@@ -1209 +1223 @@
       {
         result = result + list(M[i]);
+  dbprint(p,"Result list updated:");
+        dbprint(p,result);
         M = delete(M,i);
         continue;
@@ -1591 +1607 @@
 PURPOSE: compute all factorizations of a polynomial in the first shift algebra
 THEORY: Implements the new algorithm by A. Heinle and V. Levandovskyy, see the thesis of A. Heinle
-ASSUME: basering in the first shift algebra
+ASSUME: basering is the first shift algebra
 NOTE: Every entry of the output list is a list with factors for one possible factorization.
 EXAMPLE: example facFirstShift; shows examples
@@ -1751 +1767 @@
     {//We have one factorization
       result = result + list(M[i]);
+      dbprint(p,"Result list updated:");
+      dbprint(p,result);
       M = delete(M,i);
       continue;
@@ -1870 +1888 @@
       {
         result = result + list(M[i]);
+        dbprint(p,"Result list updated:");
+        dbprint(p,result);
         M = delete(M,i);
         continue;
@@ -1890 +1910 @@
     result = list(list(1,h));
   }//only the trivial factorization could be found
+  dbprint(p,"==> done");
   return(result);
 }//proc facshift
@@ -1972 +1993 @@
 //==================================================
 //A function to get the i'th triangular number
-proc triangNum(int n)
+static proc triangNum(int n)
 {
-     if (n == 0)
-     {
-          return(0);
-     }
-     return (n*(n+1)/2);
+  if (n == 0)
+  {
+    return(0);
+  }
+  return (n*(n+1)/2);
 }
 
@@ -1995 +2016 @@
         variable. If k is positive, the last k entries will be x. The other
         entries will be irreducible polynomials of degree zero or 1 resp. -1.
-SEE ALSO: homogfacFirstWeyl
+SEE ALSO: homogfacFirstWeyl, homogfacFirstQWeyl_all
 "{//proc homogfacFirstQWeyl
   int p = printlevel-voice+2;//for dbprint
@@ -2047 +2068 @@
   dbprint(p,"==> Done");
   dbprint(p,"==> Mapping this monomials to K(q)[theta]");
-  def characteristic = ringlist(r)[1][1];
-  def qparameter      = ringlist(r)[1][2][1];
-  ring tempRing = (characteristic,q),(x,y,theta),dp; //TODO: How to map a parameter?
+  //Now, map to the commutative ring with theta:
+  list tempRingList = ringlist(r);
+  tempRingList[2] = insert(tempRingList[2],"theta",2); //New variable theta = x*d
+  tempRingList = delete(tempRingList,5);
+  tempRingList = delete(tempRingList,5); //The ring should now be commutative
+  def tempRing = ring(tempRingList);
   setring tempRing;
-  map thetamap = r,x,y;
+  map thetamap = r,var(1),var(2);
   list mons = thetamap(mons);
   poly entry;
@@ -2057 +2081 @@
   for (i = 1; i<=size(mons);i++)
   {//transforming the monomials as monomials in theta
-       entry = 1; //leadcoef(mons[i]) * q^(-triangNum(leadexp(mons[i])[2]-1));
+    entry = 1;//leadcoef(mons[i]) * q^(-triangNum(leadexp(mons[i])[2]-1));
     for (j = 0; j<leadexp(mons[i])[2];j++)
     {
-//"j:";j;
-         tempSummand = (q^j-1)/(q-1);
-         entry = entry * theta-tempSummand*entry;
-    }
-//~;
- mons[i] = entry*leadcoef(mons[i]) * q^(-triangNum(leadexp(mons[i])[2]-1));
+      tempSummand = (par(1)^j-1)/(par(1)-1);
+      entry = entry * theta-tempSummand*entry;
+    }
+    //entry;
+    //leadcoef(mons[i]) * q^(-triangNum(leadexp(mons[i])[2]-1));
+    mons[i] = entry*leadcoef(mons[i]) * par(1)^(-triangNum(leadexp(mons[i])[2]-1));
   }//transforming the monomials as monomials in theta
   dbprint(p,"==> Done");
@@ -2102 +2126 @@
   //Correction of the result in the special q-Case:
   for (j = 2 ; j<= size(result);j++)
-  {//Divide the whole Term by the leading coefficient and multiply it to the first entry in result[i]
-       result[1] = result[1] * leadcoef(result[j]);
-       result[j] = 1/leadcoef(result[j]) * result[j];
-  }//Divide the whole Term by the leading coefficient and multiply it to the first entry in result[i]
+  {//Div the whole Term by the leading coefficient and multiply it to the first entry in result[i]
+    result[1] = result[1] * leadcoef(result[j]);
+    result[j] = 1/leadcoef(result[j]) * result[j];
+  }//Div the whole Term by the leading coefficient and multiply it to the first entry in result[i]
   return(result);
 }//proc homogfacFirstQWeyl
+example
+{
+  "EXAMPLE:";echo=2;
+  ring R = (0,q),(x,d),dp;
+  def r = nc_algebra (q,1);
+  setring(r);
+  poly h = q^25*x^10*d^10+q^16*(q^4+q^3+q^2+q+1)^2*x^9*d^9+
+           q^9*(q^13+3*q^12+7*q^11+13*q^10+20*q^9+26*q^8+30*q^7+
+           31*q^6+26*q^5+20*q^4+13*q^3+7*q^2+3*q+1)*x^8*d^8+
+           q^4*(q^9+2*q^8+4*q^7+6*q^6+7*q^5+8*q^4+6*q^3+
+     4*q^2+2q+1)*(q^4+q^3+q^2+q+1)*(q^2+q+1)*x^7*d^7+
+           q*(q^2+q+1)*(q^5+2*q^4+2*q^3+3*q^2+2*q+1)*(q^4+q^3+q^2+q+1)*(q^2+1)*(q+1)*x^6*d^6+
+           (q^10+5*q^9+12*q^8+21*q^7+29*q^6+33*q^5+31*q^4+24*q^3+15*q^2+7*q+12)*x^5*d^5+
+           6*x^3*d^3+24;
+  homogfacFirstQWeyl(h);
+}
 
 
@@ -2114 +2154 @@
 //Computes all possible homogeneous factorizations for an element in the first Q-Weyl Algebra
 proc homogfacFirstQWeyl_all(poly h)
-"USAGE: homogfacFirstWWeyl_all(h); h is a homogeneous polynomial in the first q-Weyl algebra
+"USAGE: homogfacFirstQWeyl_all(h); h is a homogeneous polynomial in the first q-Weyl algebra
         with respect to the weight vector [-1,1]
 RETURN: list
@@ -2125 +2165 @@
         the first q-Weyl algebra, the permutations of this element with the other
         entries will also be computed.
-SEE ALSO: homogfacFirstWeyl
+SEE ALSO: homogfacFirstQWeyl
 "{//proc HomogfacFirstQWeylAll
   int p=printlevel-voice+2;//for dbprint
@@ -2182 +2222 @@
   {//list_not_azero is not empty
     list_not_azero =
-      one_hom_fac[(size(one_hom_fac)-absValue(deg(h,ivm11))+1)..size(one_hom_fac)];
+    one_hom_fac[(size(one_hom_fac)-absValue(deg(h,ivm11))+1)..size(one_hom_fac)];
     is_list_not_azero_empty = 0;
   }//list_not_azero is not empty
   //Map list_azero in K[theta]
   dbprint(p,"==> Map list_azero to K[theta]");
-  def characteristic = ringlist(r)[1][1];
-  def qparameter      = ringlist(r)[1][2][1];
-  ring tempRing = (characteristic,q),(x,y,theta),dp; //TODO: How to map a parameter?
+  //Now, map to the commutative ring with theta:
+  list tempRingList = ringlist(r);
+  tempRingList[2] = insert(tempRingList[2],"theta",2); //New variable theta = x*d
+  tempRingList = delete(tempRingList,5);
+  tempRingList = delete(tempRingList,5); //The ring should now be commutative
+  def tempRing = ring(tempRingList);
   setring(tempRing);
   poly entry;
-  map thetamap = r,x,y;
+  map thetamap = r,var(1),var(2);
   if(!is_list_not_azero_empty)
   {//Mapping in Singular is only possible, if the list before
@@ -2217 +2260 @@
     for (j = 1 ; j<=size(tempmons);j++)
     {
-         //entry = leadcoef(tempmons[j]);
-         entry = leadcoef(tempmons[j]) * q^(-triangNum(leadexp(tempmons[j])[2]-1));
+      //entry = leadcoef(tempmons[j]);
+      entry = leadcoef(tempmons[j]) * par(1)^(-triangNum(leadexp(tempmons[j])[2]-1));
       for (k = 0; k < leadexp(tempmons[j])[2];k++)
       {
-           entry = entry*(theta-(q^k-1)/(q-1));
+        entry = entry*(theta-(par(1)^k-1)/(par(1)-1));
       }
       tempmons[j] = entry;
@@ -2257 +2300 @@
         else
         {
-             if (shift < 0)
-             {//We have two distict formulas for x and y. In this case use formula for y
-                  if (shift == -1)
-                  {
-                       result[i][j] = subst(result[i][j],theta,1/q*(theta - 1));
-                  }
-                  else
-                  {
-                       result[i][j] = subst(result[i][j],theta,1/q*((theta - 1)/q^(absValue(shift)-1) - (q^(shift +2)-q)/(1-q)));
-                  }
-             }//We have two distict formulas for x and y. In this case use formula for y
-             if (shift > 0)
-             {//We have two distict formulas for x and y. In this case use formula for x
-                  if (shift == 1)
-                  {
-                       result[i][j] = subst(result[i][j],theta,q*theta + 1);
-                  }
-                  else
-                  {
-                       result[i][j] = subst(result[i][j],theta,q^shift*theta+(q^shift-1)/(q-1));
-                  }
-             }//We have two distict formulas for x and y. In this case use formula for x
+          if (shift < 0)
+          {//We have two distict formulas for x and y. In this case use formula for y
+            if (shift == -1)
+            {
+              result[i][j] = subst(result[i][j],theta,1/par(1)*(theta - 1));
+            }
+            else
+            {
+              result[i][j] =
+                subst(result[i][j],
+                  theta,
+                  1/par(1)*((theta - 1)/par(1)^(absValue(shift)-1)
+                    - (par(1)^(shift +2)-par(1))/(1-par(1))));
+            }
+          }//We have two distict formulas for x and y. In this case use formula for y
+          if (shift > 0)
+          {//We have two distict formulas for x and y. In this case use formula for x
+            if (shift == 1)
+            {
+              result[i][j] = subst(result[i][j],theta,par(1)*theta + 1);
+            }
+            else
+            {
+              result[i][j] =
+                subst(result[i][j],
+                theta,par(1)^shift*theta+(par(1)^shift-1)/(par(1)-1));
+            }
+          }//We have two distict formulas for x and y. In this case use formula for x
         }
       }
@@ -2316 +2365 @@
         break;
       }//the jth entry is theta and can be written as x*y
-      if(result[i][j] == q*theta +1)
+      if(result[i][j] == par(1)*theta +1)
       {
         thetapos = j;
@@ -2359 +2408 @@
         if (shift_sign<0)
         {
-             leftpart[j] = subst(leftpart[j-1],theta, 1/q*(theta +shift_sign));
+          leftpart[j] = subst(leftpart[j-1],theta, 1/par(1)*(theta +shift_sign));
         }
         if (shift_sign>0)
         {
-             leftpart[j] = subst(leftpart[j-1],theta, q*theta + shift_sign);
+          leftpart[j] = subst(leftpart[j-1],theta, par(1)*theta + shift_sign);
         }
         leftpart[j-1] = shiftvar;
@@ -2392 +2441 @@
         if (shift_sign<0)
         {
-             rightpart[j] = subst(rightpart[j+1], theta, q*theta - shift_sign);
+          rightpart[j] = subst(rightpart[j+1], theta, par(1)*theta - shift_sign);
         }
         if (shift_sign>0)
         {
-             rightpart[j] = subst(rightpart[j+1], theta, 1/q*(theta - shift_sign));
+          rightpart[j] = subst(rightpart[j+1], theta, 1/par(1)*(theta - shift_sign));
         }
         rightpart[j+1] = shiftvar;
@@ -2431 +2480 @@
   return(result);
 }//proc HomogfacFirstQWeylAll
+example
+{
+  "EXAMPLE:";echo=2;
+  ring R = (0,q),(x,d),dp;
+  def r = nc_algebra (q,1);
+  setring(r);
+  poly h = q^25*x^10*d^10+q^16*(q^4+q^3+q^2+q+1)^2*x^9*d^9+
+           q^9*(q^13+3*q^12+7*q^11+13*q^10+20*q^9+26*q^8+30*q^7+
+           31*q^6+26*q^5+20*q^4+13*q^3+7*q^2+3*q+1)*x^8*d^8+
+           q^4*(q^9+2*q^8+4*q^7+6*q^6+7*q^5+8*q^4+6*q^3+
+           4*q^2+2q+1)*(q^4+q^3+q^2+q+1)*(q^2+q+1)*x^7*d^7+
+           q*(q^2+q+1)*(q^5+2*q^4+2*q^3+3*q^2+2*q+1)*(q^4+q^3+q^2+q+1)*(q^2+1)*(q+1)*x^6*d^6+
+           (q^10+5*q^9+12*q^8+21*q^7+29*q^6+33*q^5+31*q^4+24*q^3+15*q^2+7*q+12)*x^5*d^5+
+           6*x^3*d^3+24;
+  homogfacFirstQWeyl_all(h);
+}
 
 //TODO: FirstQWeyl check the parameters...
@@ -2452 +2517 @@
 def l= facFirstWeyl (a); l;
 kill l;
-poly b = -5328z8x5-5328z7x6+720z9x2+720z8x3-16976z7x4-38880z6x5-5184z7x3-5184z6x4-3774z5x5+2080z8x+5760z7x2-6144z6x3-59616z5x4+3108z3x6-4098z6x2-25704z5x3-21186z4x4+8640z6x-17916z4x3+22680z2x5+2040z5x-4848z4x2-9792z3x3+3024z2x4-10704z3x2-3519z2x3+34776zx4+12096zx3+2898x4-5040z2x+8064x3+6048x2; //Abgebrochen nach 1.5 Stunden; seems to be very complicated
+poly b = -5328z8x5-5328z7x6+720z9x2+720z8x3-16976z7x4-38880z6x5
+-5184z7x3-5184z6x4-3774z5x5+2080z8x+5760z7x2-6144z6x3-59616z5x4
++3108z3x6-4098z6x2-25704z5x3-21186z4x4+8640z6x-17916z4x3+22680z2x5
++2040z5x-4848z4x2-9792z3x3+3024z2x4-10704z3x2-3519z2x3+34776zx4
++12096zx3+2898x4-5040z2x+8064x3+6048x2; //Abgebrochen nach 1.5 Stunden;seems to be very complicated
 def l= facFirstWeyl (b); l;
 

Tst/Long/ok_l.lst

@@ -39 +39 @@
 mre
 mre_nonhom
+ncfactor_tsai_l
 paraplan
 pAdd0L_l

Tst/Short/ok_s.lst

@@ -171 +171 @@
 ; mpsr_s
 mres_s
+ncfactor_example_all_procedures_s
+ncfactor_inhomog_s
 normal
 paraplan_s