Changeset ed7a55c in git for Singular/LIB/finvar.lib
- Timestamp:
- May 4, 2011, 6:43:04 PM (13 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 67803ecd35bc4dd74c768bc01e2b8fc76697c8b3
- Parents:
- 1396fe648a0f4205e55e98d2dae5d30cb1b6163c
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/finvar.lib
r1396fe red7a55c 481 481 } 482 482 if (ch<>0) 483 { if ((g /r)*r<>g)483 { if ((g div r)*r<>g) 484 484 { "ERROR: <int> should divide the group order." 485 485 return(); … … 562 562 M[1,2]=M[1,2]*p; 563 563 if (interval<>0) // canceling common terms of denominator 564 { if ((j /interval)*interval==j or j==g) // and enumerator -564 { if ((j div interval)*interval==j or j==g) // and enumerator - 565 565 { s=matrix(syz(ideal(M))); // once gcd() is faster than syz() these 566 566 M[1,1]=-s[2,1]; // three lines should be replaced by the … … 712 712 else 713 713 { if (interval<>0) // canceling common terms of denominator 714 { if ((i /interval)*interval==i or i==g) // and enumerator714 { if ((i div interval)*interval==i or i==g) // and enumerator 715 715 { s=matrix(syz(ideal(M))); // once gcd() is faster than syz() 716 716 M[1,1]=-s[2,1]; // these three lines should be … … 831 831 M[1,2]=M[1,2]*p; 832 832 if (interval<>0) // canceling common terms of denominator 833 { if ((i /interval)*interval==i or i==g) // and enumerator833 { if ((i div interval)*interval==i or i==g) // and enumerator 834 834 { 835 835 s=matrix(syz(ideal(M))); // once gcd() is faster than syz() these … … 1081 1081 A(2)[1,2]=A(2)[1,2]*p; 1082 1082 if (interval<>0) // canceling common terms of denominator 1083 { if ((i /interval)*interval==i) // and enumerator1083 { if ((i div interval)*interval==i) // and enumerator 1084 1084 { 1085 1085 s=matrix(syz(ideal(A(2)))); // once gcd() is faster than syz() these … … 1127 1127 A(2)[1,2]=A(2)[1,2]*p; // expanding A(2)[1,1]/A(2)[1,2] + 1/p - 1128 1128 if (interval<>0) // canceling common terms of denominator 1129 { if ((g /interval)*interval==g) // and enumerator1129 { if ((g div interval)*interval==g) // and enumerator 1130 1130 { 1131 1131 s=matrix(syz(ideal(A(2)))); // once gcd() is faster than syz() … … 1166 1166 } 1167 1167 if (interval<>0) // canceling common terms of denominator 1168 { if ((g /interval)*interval<>g) // and enumerator1168 { if ((g div interval)*interval<>g) // and enumerator 1169 1169 { 1170 1170 s=matrix(syz(ideal(A(2)))); // once gcd() is faster than syz() … … 1290 1290 A(2)[1,2]=A(2)[1,2]*p; 1291 1291 if (interval<>0) // canceling common terms of denominator 1292 { if ((i /interval)*interval==i) // and enumerator1292 { if ((i div interval)*interval==i) // and enumerator 1293 1293 { 1294 1294 s=matrix(syz(ideal(A(2)))); // once gcd() is faster than syz() these … … 1349 1349 A(2)[1,2]=A(2)[1,2]*p; // expanding A(2)[1,1]/A(2)[1,2] + 1/p - 1350 1350 if (interval<>0) // canceling common terms of denominator 1351 { if ((g /interval)*interval==g) // and enumerator1351 { if ((g div interval)*interval==g) // and enumerator 1352 1352 { 1353 1353 s=matrix(syz(ideal(A(2)))); // once gcd() is faster than syz() … … 1390 1390 } 1391 1391 if (interval<>0) // canceling common terms of denominator 1392 { if ((g /interval)*interval<>g) // and enumerator1392 { if ((g div interval)*interval<>g) // and enumerator 1393 1393 { 1394 1394 s=matrix(syz(ideal(A(2)))); // once gcd() is faster than syz() … … 6191 6191 { max=max*deg(P[j]); 6192 6192 } 6193 max=max /nrows(REY);6193 max=max div nrows(REY); 6194 6194 if (v) 6195 6195 { " We need to find ",max," secondary invariants."; … … 6444 6444 { max=max*deg(P[j]); 6445 6445 } 6446 max=max /nrows(REY);6446 max=max div nrows(REY); 6447 6447 if (v) 6448 6448 { " We need to find ",max," secondary invariants.";
Note: See TracChangeset
for help on using the changeset viewer.