Changeset 5d623c in git for kernel

Timestamp:

Dec 2, 2016, 6:49:32 PM (7 years ago)

Author:

Sharwan Tiwari <shrawant@…>

Branches:

(u'spielwiese', '2a584933abf2a2d3082034c7586d38bb6de1a30a')

Children:

665dab88a13186ce5e6abca704e42280baad6b91

Parents:

174bcf3262ce524919d5ef06586fee3331f4cd94

Message:

multi-graded Hilbert series of non-commutative monomial algebras

Location:

kernel/combinatorics

Files:

• hilb.cc (modified) (8 diffs)
• hutil.h (modified) (1 diff)

kernel/combinatorics/hilb.cc

@@ -37 +37 @@
 #include <coeffs/numbers.h>
 #include <vector>
+#include <Singular/ipshell.h>
 
 #endif
@@ -1685 +1686 @@
       if(p_LmDivisibleBy(I->m[i], I->m[k], currRing))
       {
-        pDelete(&(I->m[k]));//this is not req.
+        pDelete(&(I->m[k]));
         break;
       }
@@ -1856 +1857 @@
 }
 
-
-void HilbertSeries_OrbitData(ideal S, int lV, bool IG_CASE )
+void HilbertSeries_OrbitData(ideal S, int lV, bool IG_CASE, bool mgrad, bool odp)
 {
   /*
@@ -1875 +1875 @@
   if(IG_CASE)
   {
+    if(idIs0(S))
+    {
+      WerrorS("wrong input:not the infinitely gen. case");
+        return;
+    }
     trInd = p_Totaldegree(S->m[IDELEMS(S)-1], currRing);
     POS = &positionInOrbit_IG_Case;
@@ -1891 +1896 @@
   polist.push_back( p_One(currRing));
 
-  std::vector< std::vector<int> > mat;
-  std::vector<int> row;
-  row.push_back(0);
-
+  std::vector< std::vector<int> > posMat; 
+  std::vector<int> posRow(lV,0);         
   std::vector<int> C;
 
-  int ds, is, ps, sz;
+  int ds, is, ps;
   int lpcnt = 0;
 
@@ -1943 +1946 @@
       Jwi = colonIdeal(S, wi, lV, Jwi);
       ps = (*POS)(Jwi, wi, idorb, polist, trInd);
-
-      if(ps == 0)  // found new colon ideal
+      
+      if(ps == 0)  // finds a new ideal
       {
+        posRow[is-1] = idorb.size();
 
         idorb.push_back(Jwi);
         polist.push_back(wi);
-        row.push_back(1);
       }
-      else // there is a same ideal in the orbit
+      else // ideal is already there  in the orbit
       {
-        row[ps-1] = row[ps-1] + 1;
+        posRow[is-1]=ps-1;      
         idDelete(&Jwi);
         pDelete(&wi);
       }
     }
-    mat.push_back(row);
-    sz = row.size();
-    row.clear();
-    row.resize(sz, 0);
+    posMat.push_back(posRow); 
+    posRow.resize(lV,0);  
+  }
+  int lO = C.size();//size of the orbit 
+  PrintLn();
+  Print("Maximal length of words = %ld\n", p_Totaldegree(polist[lO-1], currRing));
+  Print("\nOrbit length = %d\n", lO);
+  PrintLn();
+ 
+  if(odp)
+  {
+    Print("Words description of the Orbit: \n");
+    for(is = 0; is < lO; is++)
+    {
+      pWrite0(polist[is]);
+      PrintS("    ");
+    }
+    PrintLn();
   }
 
@@ -1975 +1992 @@
   idorb.resize(0);
   polist.resize(0);
-
-  row.resize(0);
-
+  
+  int adjMatrix[lO][lO];
+  memset(adjMatrix, 0, lO*lO*sizeof(int));
   int rowCount, colCount;
-#if 0
-  for(rowCount = 0; rowCount < mat.size(); rowCount++)
-  {
-    for(colCount = 0; colCount  < mat[rowCount].size(); colCount++)
-    {
-      Print("%d,",mat[rowCount][colCount]);
-    }
-    PrintLn();
-  }
-  printf("rhs column matrix::\n");
-  for(colCount = 0; colCount < C.size(); colCount++)
-  printf("%d,",C[colCount]);
-  //printf("\nlength of the Orbit==%ld\n", C.size());
-#endif
+  int tm = 0;
+  if(!mgrad)
+  {
+    for(rowCount = 0; rowCount < lO; rowCount++)
+    {
+      for(colCount = 0; colCount < lV; colCount++)
+      {
+        tm = posMat[rowCount][colCount];
+        adjMatrix[rowCount][tm] = adjMatrix[rowCount][tm] + 1;
+      }
+    }
+  }
+  
   ring r = currRing;
-  char** tt=(char**)omalloc(sizeof(char*));
-  tt[0] = omStrDup("t");
+  int npar;
+  char** tt;
   TransExtInfo p;
-  p.r = rDefault(0, 1, tt);
-  coeffs cf = nInitChar(n_transExt,&p);
-
+  if(!mgrad)
+  {
+    tt=(char**)omalloc(sizeof(char*));
+    tt[0] = omStrDup("t");
+    npar = 1;
+  }
+  else
+  {
+    tt=(char**)omalloc(lV*sizeof(char*));
+    for(is = 0; is < lV; is++)
+    {
+      tt[is] = (char*)omalloc(7*sizeof(char)); //if required enlarge it later
+      sprintf (tt[is], "t(%d)", is+1);
+    }
+    npar = lV;
+  }
+
+  p.r = rDefault(0, npar, tt);
+  coeffs cf = nInitChar(n_transExt, &p);
   char** xx = (char**)omalloc(sizeof(char*));
   xx[0] = omStrDup("x");
   ring R = rDefault(cf, 1, xx);
-  rChangeCurrRing(R);
+  rChangeCurrRing(R);//rWrite(R);
   /*
    * matrix corresponding to the orbit of the ideal
    */
-  int lO = C.size();//size of the orbit
   matrix mR = mpNew(lO, lO);
   matrix cMat = mpNew(lO,1);
+  poly rc;
+  
+  if(!mgrad)
+  {
+    for(rowCount = 0; rowCount < lO; rowCount++)
+    {
+      for(colCount = 0; colCount < lO; colCount++)
+      {
+        if(adjMatrix[rowCount][colCount] != 0)
+        {
+          MATELEM(mR, rowCount + 1, colCount + 1) = p_ISet(adjMatrix[rowCount][colCount], R);
+          p_SetCoeff(MATELEM(mR, rowCount + 1, colCount + 1), n_Mult(pGetCoeff(mR->m[lO*rowCount+colCount]),n_Param(1, R->cf), R->cf), R);
+        }
+      }
+    }
+  }
+  else
+  {
+     for(rowCount = 0; rowCount < lO; rowCount++)
+     {
+       for(colCount = 0; colCount < lV; colCount++)
+       {
+          rc=NULL; 
+          rc=p_One(R); 
+          p_SetCoeff(rc, n_Mult(pGetCoeff(rc), n_Param(colCount+1, R->cf),R->cf), R);
+          MATELEM(mR, rowCount +1, posMat[rowCount][colCount]+1)=p_Add_q(rc,MATELEM(mR, rowCount +1, posMat[rowCount][colCount]+1), R);
+       }
+     }
+  }
 
   for(rowCount = 0; rowCount < lO; rowCount++)
   {
-    for(colCount = 0; colCount < mat[rowCount].size(); colCount++)
-    {
-      if(mat[rowCount][colCount] != 0)
+    if(C[rowCount] != 0)
+    {
+      MATELEM(cMat, rowCount + 1, 1) = p_ISet(C[rowCount], R);
+    }
+  }
+  
+  matrix u;
+  unitMatrix(lO, u); //unit matrix
+  matrix gMat = mp_Sub(u, mR, R);
+  char* s;
+  if(odp)
+  {
+    PrintS("\nlinear system:\n");
+    if(!mgrad)
+    {
+      for(rowCount = 0; rowCount < lO; rowCount++)
       {
-       MATELEM(mR, rowCount + 1, colCount + 1) = p_ISet(mat[rowCount][colCount], R);
-        p_SetCoeff(MATELEM(mR, rowCount + 1, colCount + 1), n_Mult(pGetCoeff(mR->m[lO*rowCount+colCount]),n_Param(1, R->cf), R->cf), R);
+        Print("H(%d) = ", rowCount+1);
+        for(colCount = 0; colCount < lV; colCount++)
+        {   
+          StringSetS(""); nWrite(n_Param(1, R->cf));
+          s = StringEndS(); PrintS(s);
+          Print("*"); omFree(s);
+          Print("H(%d) + ", posMat[rowCount][colCount] + 1);
+        }
+        Print(" %d\n", C[rowCount] );
       }
-    }
-    if(C[rowCount] != 0)
-    {
-      cMat->m[rowCount] = p_ISet(C[rowCount], R);
-    }
-    mat[rowCount].resize(0);
-  }
-  mat.resize(0);
+      PrintS("where H(1) represents the series corresp. to input ideal\n");
+      PrintS("and i^th summand in the rhs of an eqn. is according\n");
+      PrintS("to the right colon map corresp. to the i^th variable\n");
+    }
+    else
+    {
+      for(rowCount = 0; rowCount < lO; rowCount++)
+      {
+        Print("H(%d) = ", rowCount+1);
+        for(colCount = 0; colCount < lV; colCount++)
+        {
+           StringSetS(""); nWrite(n_Param(colCount+1, R->cf));
+           s = StringEndS(); PrintS(s);
+           Print("*");omFree(s);
+           Print("H(%d) + ", posMat[rowCount][colCount] + 1);
+        }
+        Print(" %d\n", C[rowCount] );
+      }
+      PrintS("where H(1) represents the series corresp. to input ideal\n");
+    }
+  }
+  posMat.resize(0);
   C.resize(0);
-  matrix u;
-  unitMatrix(lO,u); //unit matrix
-  matrix gMat=mp_Sub(u,mR,R);
   matrix pMat;
   matrix lMat;
@@ -2040 +2131 @@
   luSolveViaLUDecomp(pMat, lMat, uMat, cMat, H_serVec, Hnot);
 
-  mp_Delete(&mR,R);
-  mp_Delete(&u,R);
-  mp_Delete(&pMat,R);
-  mp_Delete(&lMat,R);
-  mp_Delete(&uMat,R);
-  mp_Delete(&cMat,R);
-  mp_Delete(&gMat,R);
-  mp_Delete(&Hnot,R);
+  mp_Delete(&mR, R);
+  mp_Delete(&u, R);
+  mp_Delete(&pMat, R);
+  mp_Delete(&lMat, R);
+  mp_Delete(&uMat, R);
+  mp_Delete(&cMat, R);
+  mp_Delete(&gMat, R);
+  mp_Delete(&Hnot, R);
   //print the Hilbert series and Orbit length
   PrintLn();
+  Print("Hilbert series:");
+  PrintLn();
   pWrite(H_serVec->m[0]);
-  Print("\nOrbit size = %d\n", lO);
-
-  omFree(tt[0]);
+  PrintLn();
+  if(!mgrad)
+  {
+    omFree(tt[0]);
+  }
+  else
+  {
+    for(is = lV-1; is >= 0; is--)
+
+      omFree( tt[is]);
+  }
   omFree(tt);
   omFree(xx[0]);
   omFree(xx);
   rChangeCurrRing(r);
-  rDelete(R);
-}
-
-
+  rKill(R);
+}

kernel/combinatorics/hutil.h

@@ -84 +84 @@
 scfmon hInit(ideal S, ideal Q, int * Nexist, ring tailRing);
 void slicehilb(ideal I);
-void HilbertSeries_OrbitData(ideal S, int lV, bool ig);
+void HilbertSeries_OrbitData(ideal S, int lV, bool ig, bool mgrad, bool odp);
 #endif