Changeset 1bf4c54 in git

Timestamp:

Nov 24, 2017, 12:35:48 PM (6 years ago)

Author:

Karim Abou Zeid <karim23697@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

67a25dc16190bd3be04c9899cc5aba41125ec8b9

Parents:

4d0ea67733b0f73e65b8a437610cac163471ee33

Message:

Fix prime/semi-prime for a special case

File:

• Singular/LIB/fpadim.lib (modified) (2 diffs)

Singular/LIB/fpadim.lib

@@ -1309 +1309 @@
   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
+    if (leadmonom(G[i]) == 1) {
+      return(1);
+    }
+  }
+  // if longest word has length 1 we handle it as a special case
+  if (l == 1) {
+    return(1);
+  }
+
   list VUG = lpUfGraph(G, 1);
   intmat UG = VUG[1]; // the Ufnarovskij graph
@@ -1380 +1399 @@
   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
+    if (leadmonom(G[i]) == 1) {
+      return(1);
+    }
+  }
+  // if longest word has length 1 we handle it as a special case
+  if (l == 1) {
+    return(1);
+  }
 
   list VUG = lpUfGraph(G, 1);