Changeset 8307d2d in git

Timestamp:

Aug 12, 2019, 11:35:29 AM (4 years ago)

Author:

Karim Abou Zeid <karim23697@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '0604212ebb110535022efecad887940825b97c3f')

Children:

d9e5b0a9e2ca74ac8fcf60a83f008cc393d9278d

Parents:

7161acac8387482214ebcdd85e77266519f0cad2

Message:

remove lpGkDim from LIB

File:

• Singular/LIB/fpaprops.lib (modified) (3 diffs)

Singular/LIB/fpaprops.lib

@@ -26 +26 @@
   lpIsSemiPrime(<GB>);    check whether A/<LM(GB)> is semi-prime
   lpIsPrime(<GB>);        check whether A/<LM(GB)> is prime
-  lpGkDim(<GB>);          compute the Gelfand Kirillov dimension of A/<GB>
   lpGlDimBound(<GB>);     compute an upper bound for the global dimension of A/<GB>
   lpSubstitute();         substitute a variable with polynomials (ring homomorphism)
@@ -43 +42 @@
     example lpIsSemiPrime;
     example lpIsPrime;
-    example lpGkDim;
     example lpGlDimBound;
     example lpSubstitute;
@@ -877 +875 @@
 }
 
-proc lpGkDim_lib(ideal G)
-"USAGE: lpGkDim(G); G an ideal in a letterplace ring
-RETURN: int
-PURPOSE: Determines the Gelfand Kirillov dimension of A/<G>
-       -1 means positive infinite
-ASSUME: - basering is a Letterplace ring
-      - G is a Groebner basis
-"
-{
-  G = lead(G);
-  G = simplify(G, 2+4+8);
-
-  // check special case 1
-  int l = 0;
-  for (int i = 1; i <= size(G); i++) {
-    // find the max degree in G
-    int d = deg(G[i]);
-    if (d > l) {
-      l = d;
-    }
-
-    // also if G is the whole ring return minus infinity
-    if (leadmonom(G[i]) == 1) {
-      ERROR("GK-Dim not defined for 0-ring")
-    }
-    kill d;
-  } kill i;
-  // if longest word has length 1, or G is the zero ideal, we handle it as a special case
-  if (l == 1 || size(G) == 0) {
-    int n = lpVarBlockSize(basering); // variable count
-    int k = size(G);
-    if (k == n) { // V = {1} no edges
-      return(0);
-    }
-    if (k == n-1) { // V = {1} with loop
-      return(1);
-    }
-    if (k <= n-2) { // V = {1} with more than one loop
-      return(-1);
-    }
-  }
-
-  dbprint("computing Ufnarovskii graph");
-  intmat UG = lpUfGraph(G);
-  if (printlevel >= voice + 1) {
-    UG;
-  }
-
-  // check special case 2
-  intmat zero[nrows(UG)][ncols(UG)];
-  if (UG == zero) {
-    return (0);
-  }
-
-  // check special case 3
-  dbprint("topological sorting of Ufnarovskii graph");
-  UG = topologicalSort(UG);
-  if (printlevel >= voice + 1) {
-    UG;
-  }
-
-  dbprint("check if Ufnarovskii graph is DAG");
-  if (imIsUpRightTriangle(UG)) {
-    UG = eliminateZerosUpTriangle(UG);
-    if (ncols(UG) == 0 || nrows(UG) == 0) { // when the diagonal was zero
-      return (0)
-    }
-    dbprint("DAG detected, using URTNZD growth alg");
-    return(UfGraphURTNZDGrowth(UG));
-  }
-
-  // otherwise count cycles in the Ufnarovskij Graph
-  dbprint("not a DAG, using regular growth alg");
-  return(UfGraphGrowth(UG));
-}
-example
-{
-  "EXAMPLE:"; echo = 2;
-  ring r = 0,(x,y,z),dp;
-  def R = freeAlgebra(r, 5); // constructs a Letterplace ring
-  R;
-  setring R; // sets basering to Letterplace ring
-  ideal I = z;//an example of infinite GK dimension
-  lpGkDim(I);
-  I = x,y,z; // gkDim = 0
-  lpGkDim(I);
-  I = x*y, x*z, z*y, z*z;//gkDim = 2
-  lpGkDim(I);
-  ideal G = y*x - x*y, z*x - x*z, z*y - y*z; G = std(G);
-  G;
-  lpGkDim(G); // 3, as expected for K[x,y,z]
-}
+// lpGkDim now implemented in dynamic module
+/* proc lpGkDim(ideal G) */
+/* "USAGE: lpGkDim(G); G an ideal in a letterplace ring */
+/* RETURN: int */
+/* PURPOSE: Determines the Gelfand Kirillov dimension of A/<G> */
+/*        -1 means positive infinite */
+/* ASSUME: - basering is a Letterplace ring */
+/*       - G is a Groebner basis */
+/* " */
+/* { */
+/*   G = lead(G); */
+/*   G = simplify(G, 2+4+8); */
+
+/*   // check special case 1 */
+/*   int l = 0; */
+/*   for (int i = 1; i <= size(G); i++) { */
+/*     // find the max degree in G */
+/*     int d = deg(G[i]); */
+/*     if (d > l) { */
+/*       l = d; */
+/*     } */
+
+/*     // also if G is the whole ring return minus infinity */
+/*     if (leadmonom(G[i]) == 1) { */
+/*       ERROR("GK-Dim not defined for 0-ring") */
+/*     } */
+/*     kill d; */
+/*   } kill i; */
+/*   // if longest word has length 1, or G is the zero ideal, we handle it as a special case */
+/*   if (l == 1 || size(G) == 0) { */
+/*     int n = lpVarBlockSize(basering); // variable count */
+/*     int k = size(G); */
+/*     if (k == n) { // V = {1} no edges */
+/*       return(0); */
+/*     } */
+/*     if (k == n-1) { // V = {1} with loop */
+/*       return(1); */
+/*     } */
+/*     if (k <= n-2) { // V = {1} with more than one loop */
+/*       return(-1); */
+/*     } */
+/*   } */
+
+/*   dbprint("computing Ufnarovskii graph"); */
+/*   intmat UG = lpUfGraph(G); */
+/*   if (printlevel >= voice + 1) { */
+/*     UG; */
+/*   } */
+
+/*   // check special case 2 */
+/*   intmat zero[nrows(UG)][ncols(UG)]; */
+/*   if (UG == zero) { */
+/*     return (0); */
+/*   } */
+
+/*   // check special case 3 */
+/*   dbprint("topological sorting of Ufnarovskii graph"); */
+/*   UG = topologicalSort(UG); */
+/*   if (printlevel >= voice + 1) { */
+/*     UG; */
+/*   } */
+
+/*   dbprint("check if Ufnarovskii graph is DAG"); */
+/*   if (imIsUpRightTriangle(UG)) { */
+/*     UG = eliminateZerosUpTriangle(UG); */
+/*     if (ncols(UG) == 0 || nrows(UG) == 0) { // when the diagonal was zero */
+/*       return (0) */
+/*     } */
+/*     dbprint("DAG detected, using URTNZD growth alg"); */
+/*     return(UfGraphURTNZDGrowth(UG)); */
+/*   } */
+
+/*   // otherwise count cycles in the Ufnarovskij Graph */
+/*   dbprint("not a DAG, using regular growth alg"); */
+/*   return(UfGraphGrowth(UG)); */
+/* } */
+/* example */
+/* { */
+/*   "EXAMPLE:"; echo = 2; */
+/*   ring r = 0,(x,y,z),dp; */
+/*   def R = freeAlgebra(r, 5); // constructs a Letterplace ring */
+/*   R; */
+/*   setring R; // sets basering to Letterplace ring */
+/*   ideal I = z;//an example of infinite GK dimension */
+/*   lpGkDim(I); */
+/*   I = x,y,z; // gkDim = 0 */
+/*   lpGkDim(I); */
+/*   I = x*y, x*z, z*y, z*z;//gkDim = 2 */
+/*   lpGkDim(I); */
+/*   ideal G = y*x - x*y, z*x - x*z, z*y - y*z; G = std(G); */
+/*   G; */
+/*   lpGkDim(G); // 3, as expected for K[x,y,z] */
+/* } */
 
 proc lpGlDimBound(ideal G)