Changeset addf91 in git

Timestamp:

Nov 16, 2016, 5:00:33 PM (7 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

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

Children:

cff7b64b4d12f3390c62da92777b8ebeaa828f74

Parents:

e09ceb1a13d66dc87c9c17bd158486e701335e88

Message:

schubert.lib: avoid dupl. names

File:

• Singular/LIB/schubert.lib (modified) (23 diffs)

Singular/LIB/schubert.lib

@@ -65 +65 @@
     quotSheaf(sheaf,sheaf)              make the quotient of two sheaves
     addSheaf(sheaf,sheaf)               make the direct sum of two sheaves
-    makeGraph(list,list)                create a graph from a list of vertices
+    makeGraphVE(list,list)              create a graph from a list of vertices
                                         and a list of edges
-    printGraph(graph)                   print procedure for graphs
+    printGraphG(graph)                   print procedure for graphs
     moduliSpace(variety,int)            create a moduli space of stable maps as
                                         an algebraic stack
@@ -89 +89 @@
     sumofquotients(stack,list)          prepare a command for parallel
                                         computation
-    part(poly,int)                      compute a homogeneous component of a
+    homog_part(poly,int)                compute a homogeneous component of a
                                         polynomial.
-    parts(poly,int,int)                 compute the sum of homogeneous
+    homog_parts(poly,int,int)           compute the sum of homogeneous
                                         components of a polynomial
     logg(poly,int)                      compute Chern characters from total
@@ -136 +136 @@
     system("install","sheaf","-",quotSheaf,2);
     system("install","sheaf","^",symmetricPowerSheaf,2);
-    system("install","graph","print",printGraph,1);
+    system("install","graph","print",printGraphG,1);
     system("install","stack","print",printStack,1);
 }
@@ -951 +951 @@
 ////////////////////////////////////////////////////////////////////////////////
 
-proc printGraph(graph G)
-"USAGE:     printGraph(G); G graph
+proc printGraphG(graph G)
+"USAGE:     printGraphG(G); G graph
 ASSUME:     G is a graph.
 THEORY:     This is the print function used by Singular to print a graph.
 KEYWORDS:   graph
-EXAMPLE:    example printGraph; shows an example
+EXAMPLE:    example printGraphG; shows an example
 "
 {
@@ -965 +965 @@
     "EXAMPLE:"; echo=2;
     ring r = 0,x,dp;
-    graph G = makeGraph(list(list(0,1,list(0,1,2)),list(1,1,list(1,0,2))),
+    graph G = makeGraphVE(list(list(0,1,list(0,1,2)),list(1,1,list(1,0,2))),
     list(list(0,1,2)));
     G;
 }
 
-proc makeGraph(list v, list e)
-"USAGE:     makeGraph(v,e); v list, e list
+proc makeGraphVE(list v, list e)
+"USAGE:     makeGraphVE(v,e); v list, e list
 ASSUME:     v is a list of vertices, e is a list of edges.
 RETURN:     graph with vertices v and edges e.
 THEORY:     Creates a graph from a list of vertices and edges.
 KEYWORDS:   graph
-EXAMPLE:    example makeGraph; shows an example
+EXAMPLE:    example makeGraphVE; shows an example
 {
     graph G;
@@ -987 +987 @@
     "EXAMPLE:"; echo=2;
     ring r = 0,x,dp;
-    graph G = makeGraph(list(list(0,1,list(0,1,2)),list(1,1,list(1,0,2))),
+    graph G = makeGraphVE(list(list(0,1,list(0,1,2)),list(1,1,list(1,0,2))),
     list(list(0,1,2)));
     G;
@@ -1559 +1559 @@
 }
 
-proc part(poly f, int n)
-"USAGE:     part(f,n); f poly, n int
+proc homog_part(poly f, int n)
+"USAGE:     homog_part(f,n); f poly, n int
 RETURN:     poly
 PURPOSE:    computing the homogeneous component of a polynomial.
-EXAMPLE:    example part; shows examples
+EXAMPLE:    example homog_part; shows examples
 "
 {
@@ -1579 +1579 @@
     ring r = 0,(x,y,z),wp(1,2,3);
     poly f = 1+x+x2+x3+x4+y+y2+y3+z+z2+xy+xz+yz+xyz;
-    part(f,0);
-    part(f,1);
-    part(f,2);
-    part(f,3);
-    part(f,4);
-    part(f,5);
-    part(f,6);
-}
-
-proc parts(poly f, int i, int j)
-"USAGE:     parts(f,i,j); f poly, i int, j int
+    homog_part(f,0);
+    homog_part(f,1);
+    homog_part(f,2);
+    homog_part(f,3);
+    homog_part(f,4);
+    homog_part(f,5);
+    homog_part(f,6);
+}
+
+proc homog_parts(poly f, int i, int j)
+"USAGE:     homog_parts(f,i,j); f poly, i int, j int
 RETURN:     poly
 THEORY:     computing a polynomial which is the sum of the homogeneous
             components of a polynomial.
-EXAMPLE:    example parts; shows examples
+EXAMPLE:    example homog_parts; shows examples
 "
 {
@@ -1600 +1600 @@
     for (k=i;k<=j;k++)
     {
-        p=p+part(f,k);
+        p=p+homog_part(f,k);
     }
     return (p);
@@ -1609 +1609 @@
     ring r = 0,(x,y,z),wp(1,2,3);
     poly f = 1+x+x2+x3+x4+y+y2+y3+z+z2+xy+xz+yz+xyz;
-    parts(f,2,4);
+    homog_parts(f,2,4);
 }
 
@@ -1622 +1622 @@
     int i,j,k,m;
     if (n==0) {p=0;}
-    if (n==1) {p=part(f,1);}
+    if (n==1) {p=homog_part(f,1);}
     else
     {
-        list l=-part(f,1);
+        list l=-homog_part(f,1);
         for (j=2;j<=n;j++)
         {
@@ -1631 +1631 @@
             for (k=1;k<j;k++)
             {
-                q=q+part(f,k)*l[j-k];
+                q=q+homog_part(f,k)*l[j-k];
             }
-            q=-j*part(f,j)-q;
+            q=-j*homog_part(f,j)-q;
             l=insert(l,q,size(l));
             kill q;
@@ -1670 +1670 @@
             for (j=1;j<=i;j++)
             {
-                q=q+factorial(j)*(-1)^(j-1)*l[i-j+1]*part(f,j)/i;
+                q=q+factorial(j)*(-1)^(j-1)*l[i-j+1]*homog_part(f,j)/i;
             }
             l=insert(l,q,size(l));
@@ -1696 +1696 @@
     for (i=0;i<=deg(f);i++)
     {
-        p=p+n^i*part(f,i);
+        p=p+n^i*homog_part(f,i);
     }
     return (p);
@@ -1715 +1715 @@
             for (j=1;j<=i;j++)
             {
-                q=q+((-1)^(i-j))*parts(l[j]*adams(f,i-j+1),0,d)/i;
+                q=q+((-1)^(i-j))*homog_parts(l[j]*adams(f,i-j+1),0,d)/i;
             }
             l=insert(l,q,size(l));
@@ -1733 +1733 @@
         for (j=1;j<=n;j++)
         {
-            M[i,j] = part(f,p[i]+j-i);
+            M[i,j] = homog_part(f,p[i]+j-i);
         }
     }
@@ -1973 +1973 @@
     poly g = var(1)^r;
     int i;
-    for (i=1;i<=r;i++) {g=g+var(1)^(r-i)*part(c,i);}
+    for (i=1;i<=r;i++) {g=g+var(1)^(r-i)*homog_part(c,i);}
     A.relations = rels,g;
     poly u = 1 + var(1);
@@ -2195 +2195 @@
     setring R;
     poly f = S.ChernCharacter;
-    return (int(part(f,0)));
+    return (int(homog_part(f,0)));
 }
 example
@@ -2249 +2249 @@
 "
 {
-    return (part(totalChernClass(S),i));
+    return (homog_part(totalChernClass(S),i));
 }
 example
@@ -2314 +2314 @@
         int i,j;
         for (i=0;i<=d;i++) {t = t + (1-f)^i;}
-        for (j=0;j<=d;j++) {h = h + part(t,j);}
+        for (j=0;j<=d;j++) {h = h + homog_part(t,j);}
         return (reduce(h,rels));
     }
@@ -2379 +2379 @@
         S.currentVariety = V2;
         poly c = imap(R1,c1);
-        poly f = parts(c*c2,0,V2.dimension);
+        poly f = homog_parts(c*c2,0,V2.dimension);
         S.ChernCharacter = f;
         return (S);
@@ -2388 +2388 @@
         S.currentVariety = V1;
         poly c = imap(R2,c2);
-        poly f = parts(c1*c,0,V1.dimension);
+        poly f = homog_parts(c1*c,0,V1.dimension);
         S.ChernCharacter = f;
         return (S);
@@ -2435 +2435 @@
             for (j=1;j<=m;j++)
             {
-                q = q + ((-1)^(j+1))*parts(w[j+1]*s[i-j+1],0,d);
+                q = q + ((-1)^(j+1))*homog_parts(w[j+1]*s[i-j+1],0,d);
             }
             s = insert(s,q,size(s));