Changeset 2bbd4a in git
- Timestamp:
- May 19, 2014, 4:40:21 PM (9 years ago)
- Branches:
- (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
- Children:
- 46c7c3543716f62ef5bb7e5989d0c0876634829a
- Parents:
- 4bc25c236b0d155b3b1e4ab40855eacaaa27c3eb
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/primdec.lib
r4bc25c r2bbd4a 3995 3995 if(n<nvars(basering)) 3996 3996 { 3997 matrix f=transpose(re[n+1]); //Hom(_,R) 3998 module k=nres(f,2)[2]; //the kernel 3999 matrix g=transpose(re[n]); //the image of Hom(_,R) 4000 4001 ideal ann=quotient1(g,k); //the anihilator 4002 } 4003 else 4004 { 4005 ideal ann=Ann(transpose(re[n])); 4006 } 3997 if(size(re[n+1])>0) 3998 { 3999 matrix f=transpose(re[n+1]); //Hom(_,R) 4000 module k=nres(f,2)[2]; //the kernel 4001 matrix g=transpose(re[n]); //the image of Hom(_,R) 4002 4003 ideal ann=quotient1(g,k); //the anihilator 4004 return(ann); 4005 } 4006 } 4007 // remaining case: re[n+1] is trivial 4008 // either n is at least number of variables or 4009 // resolution happens to be shorter 4010 ideal ann=Ann(transpose(re[n])); 4007 4011 return(ann); 4008 4012 }
Note: See TracChangeset
for help on using the changeset viewer.