1 | LIB "tst.lib"; |
---|
2 | tst_init(); |
---|
3 | |
---|
4 | // incomplete multivariate factorization over Q (tr.659) |
---|
5 | // fixes also tr.655 (incomplete primary decomp with primdecGTZ), |
---|
6 | // tr.656 (incomplete primary decomp with primdecSY) |
---|
7 | |
---|
8 | ring R=0,(a,r,v,n,g,f,h,o),dp; |
---|
9 | poly f= |
---|
10 | (248301045a2r10n2)*o10+(570807000a2r9n)*o9+(-137945025a2r8n2+328050000a2r8)*o8+(-253692000a2r7n)*o7+(30654450a2r6n2-109350000a2r6-22457088ar2vn2)*o6+(42282000a2r5n)*o5+(-3406050a2r4n2+12150000a2r4+2495232avn2)*o4+(-3132000a2r3n)*o3+(189225a2r2n2-450000a2r2)*o2+(87000a2rn)*o+(-4205a2n2); |
---|
11 | |
---|
12 | factorize(f); |
---|
13 | |
---|
14 | // tr.655 (incomplete primary decomp with primdecGTZ) |
---|
15 | LIB"primdec.lib"; |
---|
16 | ring rng = (0),(a,r,v,n,g,t,h,o),dp; |
---|
17 | ideal I = -30*a*v*t^3+2*t, |
---|
18 | 25*r*h+29*v*n^2*t*h^2+19, |
---|
19 | -18*a*r^2*o^2+24*a*v*n*t*h*o+2*a; |
---|
20 | list L1 = primdecGTZ (I); |
---|
21 | L1[2][1]; |
---|
22 | list pc2 = primdecGTZ(L1[2][1]); |
---|
23 | pc2; |
---|
24 | size(pc2); // must be 1 |
---|
25 | kill rng; |
---|
26 | |
---|
27 | // tr.656 (incomplete primary decomp with primdecSY) |
---|
28 | int i ; |
---|
29 | // repeat test, since the computation originaly failed occasionally, independent of random seed... |
---|
30 | ring rng656 = (0),(y,g,t,b),dp; |
---|
31 | ideal I = -11658/12181*g*t*b-8219/674*g*b^2, |
---|
32 | 307/3906*y^2+20884/14685*g^3+21229/26747*g, |
---|
33 | -3493/11608*y+13440/12053*g*t-1161/3359*b-1377/857; |
---|
34 | list L1; |
---|
35 | for (i=1; i<12; i++) |
---|
36 | { L1=primdecSY(I,0);size(primdecSY(L1[1][1])); } |
---|
37 | |
---|
38 | tst_status(1);$ |
---|