Changeset 89005e in git
- Timestamp:
- Jul 4, 2020, 4:54:16 PM (3 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- 9e20b9f7749f3bf1b809cdfca51f8fdbbc25e754
- Parents:
- 7032db2a39319cc0c7a7814003e93cae02793c5ed78356197b75c5a7efd1896ede6a66356bbb6d94
- Location:
- Singular/LIB
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/atkins.lib
r7032db r89005e 567 567 s3=string(t); 568 568 569 execute("a1="+s1+";");570 execute("b1="+s2+";");571 execute("t1="+s3+";");569 a1=int(a); 570 b1=int(b); 571 t1=int(t); 572 572 g1=gcd(gcd(a1,b1),t1 div a1); 573 573 setring C; -
Singular/LIB/chern.lib
r7032db r89005e 201 201 } 202 202 ring r@ = create_ring(ringlist(basering)[1], l2, "dp", "no_minpoly"); 203 execute( "map F= br@,"+varstr(br@)+";" ); // define the corresponding inclusion of rings 204 ideal V=F(V); 205 poly f=F(f); 203 ideal V=fetch(br@,V); 204 poly f=fetch(br@,f); 206 205 int i; 207 206 for(i=1; i<=nV; i++) … … 3169 3168 l13[size(l13)+1] = "u@"; 3170 3169 ring r@ = create_ring(ringlist(basering)[1], l13, "dp", "no_minpoly"); 3171 execute( "map F= br@,"+varstr(br@)+";" ); // define the corresponding inclusion of rings 3172 ideal I=F(I); // the ideal generated by I in the new ring 3170 ideal I=fetch(br@,I); // the ideal generated by I in the new ring 3173 3171 ideal J(0..n); // define n+1 ideals J(0), ... , J(n) 3174 3172 // compute the ideal of the Rees algebra of the ideal I: … … 3269 3267 l14[size(l14)+1] = "u@"; 3270 3268 ring r@ = create_ring(ringlist(basering)[1], l14, "dp", "no_minpoly"); 3271 execute( "map F= br@,"+varstr(br@)+";" ); // define the corresponding inclusion of rings 3272 ideal I=F(I); // the ideal generated by I in the new ring 3269 ideal I=fetch(br@,I); // the ideal generated by I in the new ring 3273 3270 ideal J(0..n); // define n+1 ideals J(0), ... , J(n) 3274 3271 // compute the ideal of the Rees algebra of the ideal I: … … 3404 3401 def br@=basering; // remember the base ring 3405 3402 ring r@ = create_ring(ringlist(basering)[1], "("+varstr(basering)+",homvar@)", "dp", "no_minpoly"); 3406 execute( "map F= br@,"+varstr(br@)+";" ); // define the corresponding inclusion of rings 3407 ideal I=F(I); 3403 ideal I=fetch(br@,I); 3408 3404 ideal J=homog(I, homvar@); 3409 3405 ideal JJ=J, homvar@; … … 3988 3984 l15[size(l15)+1] = "u@"; 3989 3985 ring r@ = create_ring(ringlist(basering)[1], l15, "dp", "no_minpoly"); 3990 execute( "map F= br@,"+varstr(br@)+";" ); // define the corresponding inclusion of rings 3991 ideal I=F(I); 3986 ideal I=fetch(br@,I); 3992 3987 ideal J(0..n); 3993 3988 for(i=1; i<=sz; i++) -
Singular/LIB/finvar.lib
r7032db r89005e 717 717 else 718 718 { chst=chst[i..size(chst)]; 719 execute 720 ("ring newring=(0"+chst+"),("+varstr(br)+"),("+ordstr(br)+")"); 719 list rl=ringlist(br); 720 if (typeof(rl[1]=="int")) 721 { 722 rl[1]=0; 723 } 724 else 725 { 726 rl[1][1]=0; 727 } 728 def newring=ring(rl); 729 setring newring; 721 730 722 731 } … … 726 735 minp=minp[2..size(minp)-1]; 727 736 chst=chst[i..size(chst)]; 728 execute("ring newring=(0"+chst+"),("+varstr(br)+"),("+ordstr(br)+")"); 737 list rl=ringlist(br); 738 if (typeof(rl[1]=="int")) 739 { 740 rl[1]=0; 741 } 742 else 743 { 744 rl[1][1]=0; 745 } 746 def newring=ring(rl); 747 setring newring; 729 748 execute("minpoly="+minp); 730 749 } … … 1112 1131 if (minpoly==0) 1113 1132 { if (i>size(chst)) 1114 { execute("ring newring=0,("+varstr(br)+"),("+ordstr(br)+")"); 1133 { 1134 ring newring = create_ring(0, "("+varstr(br)+")", "("+ordstr(br)+")"); 1115 1135 } 1116 1136 else 1117 1137 { chst=chst[i..size(chst)]; 1118 execute 1119 ("ring newring=(0"+chst+"),("+varstr(br)+"),("+ordstr(br)+")"); 1138 list rl=ringlist(br); 1139 if (typeof(rl[1]=="int")) 1140 { 1141 rl[1]=0; 1142 } 1143 else 1144 { 1145 rl[1][1]=0; 1146 } 1147 def newring=ring(rl); 1148 setring newring; 1120 1149 } 1121 1150 } … … 1124 1153 minp=minp[2..size(minp)-1]; 1125 1154 chst=chst[i..size(chst)]; 1126 execute("ring newring=(0"+chst+"),("+varstr(br)+"),("+ordstr(br)+")"); 1155 list rl=ringlist(br); 1156 if (typeof(rl[1]=="int")) 1157 { 1158 rl[1]=0; 1159 } 1160 else 1161 { 1162 rl[1][1]=0; 1163 } 1164 def newring=ring(rl); 1165 setring newring; 1127 1166 execute("minpoly="+minp); 1128 1167 } … … 7172 7211 { I[i]=I[i]-y(i); } 7173 7212 I=elim(I,1..n); 7174 execute("ring newring=("+charstr(br)+"),(y(1..m)),dp(m);"); 7213 list l3; 7214 for (int zz = 1; zz <= m; zz++) 7215 { 7216 l3[zz] = "y("+string(zz)+")"; 7217 } 7218 ring newring = create_ring(ringlist(br)[1], l3, "dp("+string(m)+")", "no_minpoly"); 7175 7219 if (mp!="0") 7176 7220 { execute("minpoly=number("+mp+");"); } … … 7417 7461 } 7418 7462 G=compress(G); 7419 execute("ring newring=("+charstr(br)+"),(y(1..m)),lp;"); 7463 list l4; 7464 for (int zz = 1; zz <= m; zz++) 7465 { 7466 l4[zz] = "y("+string(zz)+")"; 7467 } 7468 ring newring = create_ring(ringlist(br)[1], l4, "lp", "no_minpoly"); 7420 7469 if (mp!="0") 7421 7470 { execute("minpoly=number("+mp+");"); } -
Singular/LIB/hnoether.lib
r7032db r89005e 2016 2016 if (parstr(basering)!="") { 2017 2017 if (charstr(basering)!=string(char(basering))+","+parstr(basering)) { 2018 execute 2019 ("ring dazu=("+charstr(basering)+"),z(0.."+string(size(v)-1)+"),ls;"); 2018 list l2; 2019 for (int zz = 0; zz <= size(v)-1; zz++) 2020 { 2021 l2[size(l2)+1] = "z("+string(zz)+")"; 2022 } 2023 ring dazu = create_ring(ringlist(basering)[1], l2, "ls", "no_minpoly"); 2020 2024 } 2021 2025 else { ring dazu=char(altring),z(0..size(v)-1),ls; } … … 2024 2028 def displayring=dazu+altring; 2025 2029 */ 2026 execute("ring displayring=("+charstr(basering)+"),(z(0.."+string(size(v)-1)+"),"+varstr(basering)+"),(ls("+string(size(v))+"),"+ordstr(basering)+");"); 2030 list l1; 2031 for (int zz = 0; zz <= size(v)-1; zz++) 2032 { 2033 l1[size(l1)+1] = "z("+string(zz)+")"; 2034 } 2035 list l2=ringlist(basering)[2]; 2036 l1 = l1 + l2; 2037 ring displayring = create_ring(ringlist(basering)[1], l1, "(ls("+string(size(v))+"),"+ordstr(basering)+")", "no_minpoly"); 2027 2038 // End change by T. Keilen 2028 2039 //////////////////////////////////////////////////////////////
Note: See TracChangeset
for help on using the changeset viewer.