# Changeset db61bce in git

Ignore:
Timestamp:
Jun 6, 2014, 3:47:10 PM (9 years ago)
Branches:
Children:
4c0c4a37de4da7bacc5bab644b0efe4197b564e9
Parents:
d7295ff2c24f0d2b03594917a387c981bd47eedd
Message:
`handling nonredundant primary decompositions in primDecsAreEquivalent-test`
Files:
4 edited

Unmodified
Removed
• ## Singular/LIB/ehv.lib

 rd7295f //                                                                 // ///////////////////////////////////////////////////////////////////// proc removeRedundantComponents(list primdecResult) "USAGE:   removeRedundantComponents(L); L a primary decomposition RETURN:  an irredundant primary decomposition. EXAMPLE: example removeRedundantComponents; shows an example" proc removeRedundantComponents(list primdecResult) { int i,j; i = 1; j = 1; while  ( i<=size(primdecResult) ) { ASSUME(1, i>0 &&  i<=size(primdecResult) ); ASSUME(1, j>0 &&  j<=size(primdecResult) ); if (i!=j) { if ( isSubset( std(primdecResult[j][1]) , std(primdecResult[i][1]) ) ) { primdecResult[i] =  primdecResult[j]; primdecResult = delete(primdecResult,j); j = j - 1; /*correct j due to deletion */ if ( j size(primdecResult) ) { i = i + 1; j = 1; } } return (primdecResult); } example { "EXAMPLE:"; ring rng = 0,(x,y),dp; def L1 = list(list(ideal(x-1),ideal(x-1)),list(ideal(x-1),ideal(x-1)),list(ideal(y-2),ideal(y-2))); def L2 = list(list(ideal(x-1),ideal(x-1)),list(ideal(y-2),ideal(y-2))); L1; L2; ASSUME(0, primDecsAreEquivalent( L1, L2 ) ); } ///////////////////////////////////////////////////////////////////// EXAMPLE: example primDecsAreEquivalent; shows an example" { L = removeRedundantComponents(L); K = removeRedundantComponents(K); int s1 = size(L); int s2 = size(K);
• ## Tst/Short/libehv_s.res.gz.uu

 rd7295f begin 644 libehv_s.res.gz M'XL("!PS]U(``VQI8F5H=E]S+G)E,/BB0Y=! M^10J?X4"WQZXX&R=V8KR<'LP6,@R7E,[8G+.^SYY!''GBUYMDU/<+X[9SU=\ISD.[9^.\$.[0/^>5N4A;#L[ID\0[\/"&+?UK?<+=D/EXM, MZ`"_#WH=N#*MU4*H2FLW>4,#%KFPK!93\$(R+\$9LOUFS\$\E4ILC)_LY@O%R4K M!;=LC8]=^*DO\$AG`C8=J@%JW31+J*Y/_[7^<^D#G5[U5S42YEDI#`F'Q(B* M9-3E>/SQW;7E.<"++;,P@=WK40.5[*.653&_8E-^6;'K[ZMBGRKD9\$>R-Z&F`NET4B?&DBM_DB2D(Y565Y,T:>!89(?&2%*5.65U#-GT[DIA@?!4<,C`Q6]S'#E.#\$-#UXZ*O!D5D)L]Y>^(,W6 M\$%)C:_CPQX1Z6PA]8UL(5;/[&P,XM;DKA-\$.\F@RDFKN&:,0>3ON#9R.9!KW=\$.S6)IFY1 MM\$<-Z_-LSA0K!^Y6PF`Z790"SSHR>>!*GW(EFBO9XQH;3W1,_X=W'!B9]GM` M\$YF./&0=)Z_08` '#@[Y<@@````` ` end
• ## Tst/Short/libehv_s.stat

 rd7295f 1 >> tst_memory_0 :: 1391932188:4.0.0, 32 bit:4.0.0:i686-Linux:mamawutz:252836 1 >> tst_memory_1 :: 1391932188:4.0.0, 32 bit:4.0.0:i686-Linux:mamawutz:2240508 1 >> tst_memory_2 :: 1391932188:4.0.0, 32 bit:4.0.0:i686-Linux:mamawutz:2281480 1 >> tst_timer_1 :: 1391932188:4.0.0, 32 bit:4.0.0:i686-Linux:mamawutz:8 1 >> tst_memory_0 :: 1402062280:4.0.0, 64 bit:4.0.0:x86_64-Linux:andromeda.math.uni-hannover.de:910512 1 >> tst_memory_1 :: 1402062280:4.0.0, 64 bit:4.0.0:x86_64-Linux:andromeda.math.uni-hannover.de:2650112 1 >> tst_memory_2 :: 1402062280:4.0.0, 64 bit:4.0.0:x86_64-Linux:andromeda.math.uni-hannover.de:2760704 1 >> tst_timer_1 :: 1402062280:4.0.0, 64 bit:4.0.0:x86_64-Linux:andromeda.math.uni-hannover.de:21
• ## Tst/Short/libehv_s.tst

 rd7295f LIB("ehv.lib"); proc testRemoveReduntandComponents() { ring rng = 0,(x,y),dp; def L1 = list(list(std(ideal(x-1)),ideal(x-1)),list(std(ideal(x-1)),ideal(x-1)),list(std(ideal(y-2)),ideal(y-2))); def L2 = list(list(std(ideal(x-1)),ideal(x-1)),list(std(ideal(y-2)),ideal(y-2))); def LL1 = removeRedundantComponents(L1); ASSUME(0, size(LL1)==2); ASSUME(0, primDecsAreEquivalent( L1, L2 ) ); system("random", 1401092447); ring rng2 = 23,(x, y, z), dp; ideal I = 9*x*y^2-11*x*z^2, 11*x*y*z^2+4*x^2*z, -3*y^5+x*z-10*y*z; list L1,L2, LL1; def RI = std(radical(I)); L1 = primdecGTZ(RI); L2 = primdecGTZ(RI); LL1 = removeRedundantComponents(L1); ASSUME(0, size(LL1)==6); ASSUME(0, primDecsAreEquivalent( LL1, L1) ); ASSUME(0, primDecsAreEquivalent( L1 , L2 ) ); } proc testPrimDecsAreEquivalent() L2[2] = list( ideal(0), ideal(0)  ); ASSUME(0, 1 == primDecsAreEquivalent(L1,L2) ); } testRemoveReduntandComponents(); testPrimDecsAreEquivalent();
Note: See TracChangeset for help on using the changeset viewer.