Changeset 2b4755 in git

Timestamp:

Mar 19, 2004, 5:28:50 PM (20 years ago)

Author:

Viktor Levandovskyy <levandov@…>

Branches:

(u'spielwiese', 'a719bcf0b8dbc648b128303a49777a094b57592c')

Children:

20ee6d53a86cc7bbe5d1762a73628af8fb98231a

Parents:

72391bbb1d0acd8a82fe089b6bb86b8c7e773a73

Message:

*levandov: doc-related patches and changes


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

Location:

Singular/LIB

Files:

• ncalg.lib (modified) (6 diffs)
• nctools.lib (modified) (12 diffs)
• qmatrix.lib (modified) (3 diffs)

Singular/LIB/ncalg.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: ncalg.lib,v 1.1 2004-03-19 15:52:29 levandov Exp $";
+version="$Id: ncalg.lib,v 1.2 2004-03-19 16:28:49 levandov Exp $";
 category="Noncommutative";
 info="
@@ -25 +25 @@
 // functions for debug/logging 
 
-static proc mySetRing (string @baseName, list #)
+proc mySetRing (string @baseName, list #)
 // set @@@_RING to description of current ring
 {
@@ -60 +60 @@
 }
 
-static proc myGetRing ()
+proc myGetRing ()
 // get desription of current ring
 {
@@ -70 +70 @@
 }
 
-static proc myGetRingName ()
+proc myGetRingName ()
 // get desription of current ring, only family
 {
@@ -81 +81 @@
 }
 
-static proc myGetRingChar ()
+proc myGetRingChar ()
 // get desription of current ring, only family
 {
@@ -93 +93 @@
 
 
-static proc myInt ( list # )
+proc myInt ( list # )
 // return 0 or int(#)
 {

Singular/LIB/nctools.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: nctools.lib,v 1.2 2004-03-18 21:34:03 levandov Exp $";
+version="$Id: nctools.lib,v 1.3 2004-03-19 16:28:50 levandov Exp $";
 category="Noncommutative";
 info="
@@ -23 +23 @@
 
 AUXILIARY PROCEDURES:
-wRing(r);               alias to weightedRing,
 Newton(f);              Newton diagram of a polynomial f,
 NCRelations(r);         Recovers the non-commutative relations of a G-algebra,
 IsCentral(p,[v]);       Check for the commutativity of polynomial p with the G-algebra,
 UpOneMatrix(N);         Returns NxN matrix with 1's in the whole upper triagle,
+
+ALIAS PROCEDURES:
+wRing(r);               alias to weightedRing,
 ";
 
-///////////////////////////////////////////////////////////////////////////////
-
-proc wRing(ring r)
-"USAGE:   wRing(r); r a ring
-RETURN:  the same ring r but the order
-NOTE:    you have to activate this ring with the "setring" command
-EXAMPLE: example wRing; shows examples
-SEE ALSO: weightedRing, Gweights
-"{
-  return(weightedRing(r));
-} 
-example 
-{
-  "EXAMPLE:";echo=2;
-  LIB "qmatrix.lib";
-  def r=quant(3); // generate quant(3) and store it in r
-  setring r; // set the ring r the active ring
-  r;
-  def s=wRing(r);
-  setring s;
-  s;
-}
 ///////////////////////////////////////////////////////////////////////////////
 
@@ -179 +159 @@
 ///////////////////////////////////////////////////////////////////////////////
 
+proc wRing(def r)
+"USAGE:   see weightedRing
+"{
+  def a=weightedRing(r);
+  if (typeof(a)=="ring") { return(a); }
+  "Error";
+  return();
+} 
+example 
+{
+  "EXAMPLE:";echo=2;
+  LIB "qmatrix.lib";
+  def r=quant(3); // generate quant(3) and store it in r
+  setring r; // set the ring r the active ring
+  r;
+  def s=wRing(r);
+  setring s;
+  s;
+}
+
+///////////////////////////////////////////////////////////////////////////////
+
 // This procedure computes ei+ej-f with f running in Newton(pij) and deletes the zero rows
 
@@ -358 +360 @@
     if (n>1)
     {
-      for (int i=2; i<=n; i++)
+      int i,j;
+      for (i=2; i<=n; i++)
       {
-        for (int j=1; j<i; j++)
+        for (j=1; j<i; j++)
         {
           f=var(i)*var(j); // yx=c*xy+...
@@ -389 +392 @@
 {
   "EXAMPLE:";echo=2;
-  ring r = 0,(x,y,z),lp;
+  ring r = 0,(x,y,z),dp;
   matrix C[3][3]=0,1,2,0,0,-1,0,0,0;
   print(C);
@@ -416 +419 @@
     else 
     {
-      setring #[1];
+      def @R1 = #[1];
+      setring @R1;
     }
   }
@@ -493 +497 @@
   "EXAMPLE:";echo=2;
   ring r=0,(x,y,z),dp;
-  poly c=;
+  matrix D[3][3]=0;
+  D[1,2]=-z;
+  D[1,3]=2*x;
+  D[2,3]=-2*y;
+  ncalgebra(1,D); // this is U(sl_2)
+  poly c=4*x*y+z^2-2*z;
   IsCentral(c,1);
 }
@@ -605 +614 @@
     return(0);
   }
+  if (n<1) { return(0); }
   number mp = par(1);  
   if (n==1) { return(mp-1); }
   if (n==2) { return(mp+1); }
-  string OR = nameof(basering);
+  def OldRing = basering;
   string CH = charstr(basering);
   string MCH;
@@ -616 +626 @@
     MCH=MCH+CH[j]; j++;
   }
-  string SR = "ring @@r="+MCH+","+parstr(basering)+",dp;";
+  string SR = "ring @@rR="+MCH+","+parstr(basering)+",dp;";
   execute(SR);
-  setring @@r;
   poly @t=var(1)^n-1; // (x^2i-1)=(x^i-1)(x^i+1)
   list l=factorize(@t);
@@ -627 +636 @@
   int cnt=1;
   poly res;
-  for (j=s-1;j>=1;j--)
+  for (j=s-1; j>=1; j--)
   {
     if ( deg(@l[j]) > d) { d=deg(@l[j]); }
   }
-  for (j=1;j<=s;j++)
+  for (j=1; j<=s; j++)
   {
     if ( deg(@l[j]) == d) { @d[cnt]=@l[j]; cnt++; }
   }
-  if (size(@d)==1) { res = poly(@d[1]); }
+  if ( size(@d)==1 ) 
+  { 
+    res = poly(@d[1]); 
+  }
   else
   {
@@ -647 +659 @@
     res = @d[j];
   }
-  execute("setring "+OR);
-  poly I = imap(@@r,res);
+  setring OldRing;
+  poly I = imap(@@rR,res);
   mp = leadcoef(I);
-  kill @@r;
+  kill @@rR;
   return(mp);
 }
@@ -779 +791 @@
   string NewRing = "ring @R=("+charstr(basering)+"),("+varstr(basering)+"),("+ordstr(basering)+");";
   execute(NewRing);
-  setring @R;
   matrix @E = UpOneMatrix(N);
   @E = -1*(@E);

Singular/LIB/qmatrix.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: qmatrix.lib,v 1.2 2004-03-18 21:36:09 levandov Exp $";
+version="$Id: qmatrix.lib,v 1.3 2004-03-19 16:28:50 levandov Exp $";
 category="Noncommutative";
 info="
@@ -19 +19 @@
 ";
 
+LIB "ncalg.lib";
 LIB "nctools.lib";
-
 ///////////////////////////////////////////////////////////////////////////////
 
@@ -148 +148 @@
       m[i,nv+1-i]=1;
     }
+    int chr = myInt(#);
     ring @rrr=(0,q),(y(1..nv)),Dp;
-    if (size(#)>0)
-    {
-      if ( typeof( #[1] ) == "int" )
-      {
-        int chr = #[1];
-        if (chr>1)
-        {
-          minpoly = RooOfUnity(chr);
-        }
-        else
-        {
-          "The degree of a root should be at least 2";
-        }
-      }
-    }
-    setring @rrr;
+    minpoly = RootOfUnity(chr);
     matrix C[nv][nv]=0;
     matrix D[nv][nv]=0;