Changeset 120c9b1 in git
 Timestamp:
 Feb 17, 2014, 5:56:58 PM (10 years ago)
 Branches:
 (u'fiekerDuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b52fc4b2495505785981d640dcf7eb3e456778ef')
 Children:
 8f26085572bdbfac4561a9322ebb192165ecda95
 Parents:
 db6ce3d65adb7660eb3d95e0cdf88acac26736e8
 gitauthor:
 Jakob Kröker <kroeker@math.unihannover.de>20140217 17:56:58+01:00
 gitcommitter:
 Jakob Kröker <kroeker@math.unihannover.de>20140217 19:01:24+01:00
 Files:

 3 added
 2 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/primdecint.lib
rdb6ce3 r120c9b1 42 42 " 43 43 { 44 if(size(I)==0){return(list( ideal(0),ideal(0)));}44 if(size(I)==0){return(list(list(ideal(0),ideal(0))));} 45 45 46 46 // Initialize optional parameters  … … 97 97 98 98 list A; 99 A[1]= ideal(0); 99 100 ideal J = imap(R,J); 100 101 … … 184 185 "A is computed in "+string(rtimer  RT)+" seconds."; 185 186 } 186 for(i= 1;i<=size(A);i++)187 for(i=2;i<=size(A);i++) 187 188 { 188 189 //=== computes for all p in L the minimal associated primes of … … 944 945 setring Rp; 945 946 ideal J = imap(R,J); 947 int sizeA; 946 948 if(nu > 1) 947 949 { 948 950 //=== p is of multiplicity > 1 in q 949 list A = minAssGTZ(J); 950 setring R; 951 list A = imap(Rp,A); 952 return(list(A,p,nu)); 951 list A = minAssGTZ(J); 953 952 } 954 953 else 955 954 { 956 955 list A = primdecGTZ(J); 957 setring R; 958 list A = imap(Rp,A); 959 return(list(A,p,nu)); 960 } 956 } 957 sizeA = size(A); 958 setring R; 959 list A; 960 if (sizeA>0) { A = imap(Rp,A); } 961 return(list(A,p,nu)); 961 962 } 962 963 … … 1100 1101 { 1101 1102 list C; 1103 C[1]= ideal(0); //add dummy entry to tie C to current ring 1102 1104 int i; 1103 1105 for(i=1;i<=size(I);i++) 1104 1106 { 1105 C[i ]=I[i];1107 C[i+1]=I[i]; 1106 1108 } 1107 1109 } … … 1114 1116 ideal I=imap(Shelp,I); 1115 1117 list C; 1118 C[1]= ideal(0); //add dummy entry to tie C to current ring 1116 1119 int i; 1117 1120 for(i=1;i<=size(I);i++) 1118 1121 { 1119 C[i ]=leadcoef(I[i]);1122 C[i+1]=leadcoef(I[i]); 1120 1123 } 1121 1124 setring Shelp; … … 1129 1132 I=stdZ(I); 1130 1133 list C; 1134 C[1]= ideal(0); //add dummy entry to tie C to current ring 1131 1135 int i; 1132 1136 for(i=1;i<=size(I);i++) 1133 1137 { 1134 C[i ]=I[i];1138 C[i+1]=I[i]; 1135 1139 } 1136 1140 list rl=ringlist(R); … … 1139 1143 } 1140 1144 poly h=1; 1141 for(i= 1;i<=size(C);i++)1145 for(i=2;i<=size(C);i++) // leave out first dummy entry in C. 1142 1146 { 1143 1147 if(deg(C[i])>0){h=h*C[i];} // das muss noch besser gemacht werden, 
Tst/Short.lst
rdb6ce3 r120c9b1 52 52 Short/bug_52.tst 53 53 Short/bug_526.tst 54 Short/bug_527_s.tst 54 55 Short/bug_53.tst 55 56 Short/bug_54.tst
Note: See TracChangeset
for help on using the changeset viewer.