[SCM] an open source computer algebra system branch, cleanedupstream, updated. 6125e540ca6d66c307958938a9d53b245507c323
Bernhard R. Link
brlink at debian.org
Tue Apr 24 15:54:36 UTC 2012
The following commit has been merged in the cleanedupstream branch:
commit 6df67bab9d4267a334adf571c824a2658573a1df
Author: Hans Schoenemann <hannes at mathematik.uni-kl.de>
Date: Fri Apr 20 15:06:02 2012 +0200
fix: tr. #420: T1, T_2, T_12 for qring
diff --git a/Singular/LIB/sing.lib b/Singular/LIB/sing.lib
index 52e3174..95b90bb 100644
--- a/Singular/LIB/sing.lib
+++ b/Singular/LIB/sing.lib
@@ -573,6 +573,29 @@ NOTE: T_1(id) itself is usually of minor importance. Nevertheless, from it
EXAMPLE: example T_1; shows an example
"
{
+ def RR=basering;
+ list RRL=ringlist(RR);
+ if(RRL[4]!=0)
+ {
+ int aa=size(#);
+ ideal QU=RRL[4];
+ RRL[4]=ideal(0);
+ def RS=ring(RRL);
+ setring RS;
+ ideal id=imap(RR,id);
+ ideal QU=imap(RR,QU);
+ if(aa)
+ {
+ list RES=T_1(id+QU,1);
+ }
+ else
+ {
+ module RES=T_1(id+QU);
+ }
+ setring RR;
+ def RES=imap(RS,RES);
+ return(RES);
+ }
ideal J=simplify(id,10);
//--------------------------- hypersurface case -------------------------------
if( size(J)<2 )
@@ -654,6 +677,30 @@ NOTE: The most important information is probably vdim(T_2(id)).
EXAMPLE: example T_2; shows an example
"
{
+ def RR=basering;
+ list RRL=ringlist(RR);
+ if(RRL[4]!=0)
+ {
+ int aa=size(#);
+ ideal QU=RRL[4];
+ RRL[4]=ideal(0);
+ def RS=ring(RRL);
+ setring RS;
+ ideal id=imap(RR,id);
+ ideal QU=imap(RR,QU);
+ if(aa)
+ {
+ list RES=T_2(id+QU,1);
+ }
+ else
+ {
+ module RES=T_2(id+QU);
+ }
+ setring RR;
+ def RES=imap(RS,RES);
+ return(RES);
+ }
+
//--------------------------- initialisation ----------------------------------
def P = basering;
ideal J = id;
@@ -728,6 +775,30 @@ NOTE: Use proc miniversal from deform.lib to get miniversal deformation of i,
EXAMPLE: example T_12; shows an example
"
{
+ def RR=basering;
+ list RRL=ringlist(RR);
+ if(RRL[4]!=0)
+ {
+ int aa=size(#);
+ ideal QU=RRL[4];
+ RRL[4]=ideal(0);
+ def RS=ring(RRL);
+ setring RS;
+ ideal id=imap(RR,id);
+ ideal QU=imap(RR,QU);
+ if(aa)
+ {
+ list RES=T_12(id+QU,1);
+ }
+ else
+ {
+ list RES=T_12(id+QU);
+ }
+ setring RR;
+ list RES=imap(RS,RES);
+ return(RES);
+ }
+
//--------------------------- initialisation ----------------------------------
int n,r1,r2,d1,d2;
def P = basering;
--
an open source computer algebra system
More information about the debian-science-commits
mailing list