Changeset 101775 in git
 Timestamp:
 Feb 24, 2007, 4:15:26 PM (16 years ago)
 Branches:
 (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
 Children:
 d7cb5209bebe803a759d89681cb9177e09e438f8
 Parents:
 bd7468e27c17b2493beec0180f366c438528745d
 Location:
 Singular/LIB
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/nctools.lib
rbd7468 r101775 1 1 /////////////////////////////////////////////////////////////////////////////// 2 version="$Id: nctools.lib,v 1.2 3 20070131 23:56:33 motsakExp $";2 version="$Id: nctools.lib,v 1.24 20070224 15:15:26 Singular Exp $"; 3 3 category="Noncommutative"; 4 4 info=" … … 787 787 ncalgebra(@E, 0); 788 788 789 ideal Q = fetch(saveRing, Q); 789 ideal Q = fetch(saveRing, Q); 790 790 j = ncols(Q) + 1; 791 791 … … 855 855 { 856 856 c = C[i, j]; 857 857 858 858 if( c == 1 ) 859 859 { … … 881 881 return("The current ring is commutative!"); 882 882 } 883 883 884 884 for( i = 1; i < N; i++ ) 885 885 { … … 903 903 } 904 904 } 905 905 906 906 list LL = list(L[1], L[2], L[3], ideal(0), L[5], L[6]); 907 907 ideal Q = L[4]; 908 908 // "Q = ", string(Q); 909 909 910 910 def E = ring(LL); 911 911 setring E; // not a qring! … … 926 926 } 927 927 928 //////////////////////////////////////////////////////////////////////// 928 //////////////////////////////////////////////////////////////////////// 929 929 // ok. it is a SCA!!! 930 930 931 931 ideal QQ; 932 932 933 933 for( i = e; i >= b; i ) 934 934 { 935 935 QQ[i  b + 1] = var(i)^2; 936 936 } 937 937 938 938 QQ = twostd(QQ); 939 939 Q = simplify(NF(Q, QQ), 1 + 2 + 4); 940 940 941 941 setring saveRing; 942 942 943 943 ideal QQ = fetch(E, Q); 944 944 
Singular/LIB/reszeta.lib
rbd7468 r101775 1 1 ////////////////////////////////////////////////////////////////////////////// 2 version="$Id: reszeta.lib,v 1.1 0 20070201 18:39:17 krueger Exp $";2 version="$Id: reszeta.lib,v 1.11 20070224 15:15:26 Singular Exp $"; 3 3 category="Commutative Algebra"; 4 4 info=" … … 1758 1758 RETURN: list l 1759 1759 if a is not present: 1760 l[1]: string specifying the DenefLoeser zeta function 1760 l[1]: string specifying the DenefLoeser zeta function 1761 1761 l[2]: string specifying characteristic polynomial of monodromy, 1762 1762 if "A" was specified … … 4892 4892 intvec nE; 4893 4893 idlist[1]=list(id1,id2,nE); 4894 } 4894 } 4895 4895 if(defined(tli)){kill tli;} 4896 4896 list tli; … … 4924 4924 if(defined(prtemp)){kill prtemp;} 4925 4925 list prtemp=minAssGTZ(BO[4][i]); // Ccomp. of except. div. 4926 j=1; 4926 j=1; 4927 4927 if(size(prtemp)>1) 4928 4928 { … … 4951 4951 } 4952 4952 } 4953 // determine tli[1] and tli[2] such that 4953 // determine tli[1] and tli[2] such that 4954 4954 // V(id1) \cap D(id2) = V(tli[1]) \cap D(tli[2]) \cap BO[4][i] 4955 4955 // inside V(BO[1]) (and if necessary inside V(BO[1]+BO[2])) … … 5086 5086 if(size(id2)==0) 5087 5087 { 5088 // preimage of (principal ideal) id2 was zero, i.e. 5088 // preimage of (principal ideal) id2 was zero, i.e. 5089 5089 // generator of previous id2 not in image 5090 5090 setring S; … … 5184 5184 } 5185 5185 if(defined(tli)) {kill tli;} 5186 // determine tli[1] and tli[2] such that 5186 // determine tli[1] and tli[2] such that 5187 5187 // V(id1) \cap D(id2) = V(tli[1]) \cap D(tli[2]) \cap BO[4][i] 5188 5188 // inside V(BO[1]) (and if necessary inside V(BO[1]+BO[2])) … … 5294 5294 while(i<size(path_togo)) 5295 5295 { 5296 // we need to blow up following the path path_togo through the tree 5296 // we need to blow up following the path path_togo through the tree 5297 5297 def S=basering; 5298 5298 if(defined(T)){kill T;}
Note: See TracChangeset
for help on using the changeset viewer.