Changeset cc93648 in git
- Timestamp:
- Apr 24, 2014, 7:03:24 PM (9 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- d21b700adb5e8106ab69ce599d924b7818ffb9ad
- Parents:
- dcd3cea67ee020fad5765aab2ede6d9e49aa2e5c
- git-author:
- Jakob Kroeker <kroeker@math.uni-hannover.de>2014-04-24 19:03:24+02:00
- git-committer:
- Jakob Kröker <kroeker@math.uni-hannover.de>2014-04-25 10:51:36+02:00
- Files:
-
- 3 added
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/primdecint.lib
rdcd3ce rcc93648 897 897 "USAGE: intersectZ(I,J); I,J ideals 898 898 RETURN: the intersection of the input ideals 899 NOTE: this is needed because intersect(I,J) does not work, should be replaced900 by intersect later899 NOTE: this is an alternative to intersect(I,J) over integers, 900 is faster for some examples and should be kept for debug purposes. 901 901 EXAMPLE: example intersectZ; shows an example 902 902 { 903 903 def R = basering; 904 execute("ring S=integer,(t,"+varstr(R)+"),(dp(1),dp(nvars(R)));"); 905 ideal I=imap(R,I); 906 ideal J=imap(R,J); 907 ideal K=addIdealZ(t*I,(1-t)*J); 908 K=stdZ(K); 904 execute("ring S=integer,( X(1..nvars(R)) ), ( dp(nvars(R)) );"); 905 ideal I = fetch(R,I); 906 ideal J = fetch(R,J); 907 execute("ring St=integer, ( t, X(1..nvars(R)) ), ( dp(1), dp(nvars(R)) );"); 908 ideal I = imap(S,I); 909 ideal J = imap(S,J); 910 ideal K = addIdealZ( var(1)*I,(1-var(1))*J); 911 K = stdZ(K); 909 912 int i; 910 913 ideal L; 911 for(i=1;i<=size(K);i++) 912 { 913 if(lead(K[i])/t==0){L[size(L)+1]=K[i];} 914 } 914 for(i=1; i<=size(K); i++) 915 { 916 if ( lead(K[i])/var(1)==0 ) { L[size(L)+1] = K[i]; } 917 } 918 setring S; 919 ideal L = imap(St, L); 915 920 setring R; 916 ideal L =imap(S,L);921 ideal L = fetch(S, L); 917 922 return(L); 918 923 } -
Tst/Short.lst
rdcd3ce rcc93648 62 62 Short/bug_5.tst 63 63 Short/bug_6.tst 64 Short/bug_609.tst 64 65 Short/bug_7.tst 65 66 Short/bug_8.tst
Note: See TracChangeset
for help on using the changeset viewer.