Changeset c39fdc in git
- Timestamp:
- Apr 7, 2015, 1:56:57 PM (8 years ago)
- Branches:
- (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
- Children:
- bd1350243abeac670b9674a3caad92f65bc473e1
- Parents:
- cec9b007f86b234905874a3be5ad6ff7d0661ae4
- git-author:
- Oleksandr Motsak <motsak@mathematik.uni-kl.de>2015-04-07 13:56:57+02:00
- git-committer:
- Oleksandr Motsak <motsak@mathematik.uni-kl.de>2015-04-07 14:01:40+02:00
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/gradedModules.lib
rcec9b00 rc39fdc 48 48 grrndmap(S,D[,p,b]) generate random 0-deg homomorphism src(S) -> src(D) 49 49 grrndmap2(S,D[,p,b]) generate random 0-deg homomorphism dst(S) -> dst(D) 50 grlifting(A,B) R ANDOM! chain lifting51 grlifting2(A,B) R ANDOM! chain lifting50 grlifting(A,B) RND! chain lifting 51 grlifting2(A,B) RND! chain lifting 52 52 mappingcone(M,N) mapping cone? 53 53 mappingcone2(M,N) mapping cone2? 54 grlifting3(A,B) R ANDOM! chain lifting?55 grlifting4(A,B) R ANDOM! chain lifting?54 grlifting3(A,B) RND! chain lifting? probably wrong one 55 grlifting4(A,B) RND! chain lifting? newer from #hani# for mappingcone3 56 56 mappingcone3(A,B) mapping cone3? (using grlifting4 at the moment) 57 57 grrange(M) get the row-weightings … … 1620 1620 1621 1621 proc grlift0(M, N, alpha1) 1622 "generic random alpha0 : coker(M) -> coker(N) from random alpha1" 1622 "PURPOSE: generic random alpha0 : coker(M) -> coker(N) from random alpha1 1623 NOTE: this proc can work only if some assumptions are fulfilled (due 1624 to Wolfram)! e.g. at the end of a resolution for the source module... 1625 " 1623 1626 { 1624 1627 … … 2190 2193 */ 2191 2194 2195 proc grneg(M) 2196 "negative map 2197 TODO for Hanieh: please document this and find good motivating examples for this proc!! 2198 " 2199 { 2200 return ( grobj(-M, grrange(M), grdeg(M) ) ); 2201 } 2202 2192 2203 // note: not clear which grlifting3 should be used by the following 2193 2204 // procedure!!? … … 2227 2238 2228 2239 // ASSUME( 0, grtest(B) ); 2229 ASSUME( 0, grtest(-rM[i-1]) ); 2230 module C=grconcat(-rM[i-1],B); // FIXME: '-' is wrong! need a graded-enabled minus (e.g. grneg?) 2240 // ASSUME( 0, grtest(-rM[i-1]) ); 2241 ASSUME( 0, grtest( grneg( rM[i-1]) ) ); 2242 module C=grconcat( grneg( rM[i-1] ) ,B); // FIXME: '-' is wrong! need a graded-enabled minus (e.g. grneg?) 2231 2243 module D=grconcat(grtranspose(C), grtranspose(A)); 2232 2244 … … 2250 2262 def F=grlifting4(A,T); grview(F); 2251 2263 2252 /* BUG in the proc */ // def G=mappingcone3(A,T); grview(G); 2264 /* BUG in the proc */ 2265 def G=mappingcone3(A,T); grview(G); 2253 2266 2254 2267 /* … … 2267 2280 def H=grlifting4(R,S); grview(H); 2268 2281 2269 /* BUG in the proc */ // def G=mappingcone3(R,S); // ???????? 2282 /* BUG in the proc */ 2283 def G=mappingcone3(R,S); // ???????? 2270 2284 2271 2285 … … 2273 2287 def J=KeneshlouMatrixPresentation(intvec(4,0,1,2,1)); 2274 2288 // def N=grlifting4(I,J); 2275 /* 2nd module does not lie in the first: */ // def NN=mappingcone3(I,J); // ???????? 2289 /* 2nd module does not lie in the first: */ 2290 def NN=mappingcone3(I,J); // ???????? 2276 2291 2277 2292 } … … 2338 2353 grview(F); 2339 2354 2355 def G=mappingcone3(A,T);grview(G); 2340 2356 /* 2341 def G=mappingcone3(A,T);grview(G);2342 2357 module W=grtranspose(G[1]); 2343 2358 resolution U=mres(W,0); … … 2354 2369 def H=grlifting4(R,S); grview(H); 2355 2370 2356 //def G=mappingcone3(R,S); // ????????2371 def G=mappingcone3(R,S); // ???????? 2357 2372 2358 2373 def I=KeneshlouMatrixPresentation(intvec(2,3,0,6,2)); 2359 2374 def J=KeneshlouMatrixPresentation(intvec(4,0,1,2,1)); 2360 /* 2nd module does not lie in the first: */ // def N=grlifting4(I,J); 2361 2362 } 2375 /* 2nd module does not lie in the first: */ 2376 def N=grlifting4(I,J); 2377 2378 }
Note: See TracChangeset
for help on using the changeset viewer.