source: git/Tst/Long/resol6.tst @ bceb63

fieker-DuValspielwiese
Last change on this file since bceb63 was 75f460, checked in by Hans Schoenemann <hannes@…>, 9 years ago
format
  • Property mode set to 100644
File size: 1.8 KB
Line 
1//LIB "tst.lib";
2//tst_init();
3
4LIB"resolve.lib";
5
6
7//=====W#[1,2]
8ring r = 0,(x(1..2)),dp;
9ideal J=(x(2)^2-x(1)^3)^2-4*x(1)^5*x(2)-x(1)^7;
10list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
11
12//=====arti1
13ring r = 0,(x(1..2)),dp;
14ideal J=(x(1)^2-x(2)^3)*((x(1)-1)^2+(x(2)-1)^3);
15list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
16
17//=====arti2
18ring r = 0,(x(1..2)),dp;
19ideal J=(x(1)^2-x(2)^3)*((x(1)-1)^2-(x(2)-1)^3);
20list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
21
22ring r = 0,(x(1..3)),dp(3);            //Whitney umbrella    11 sec  12 Karten
23ideal J=(x(3)^2-x(2)*x(1)^2)*(x(1)-1);
24list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
25
26ring r = 0,(x(1..3)),dp(3);            //Villamayor           7 sec   9 Karten
27ideal J=(x(3)^2-x(2)^2*x(1)^2)*(x(1)-1);
28list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
29
30ring r = 0,(x(1..3)),dp(3);            //E6
31ideal J=(x(1)^3-x(2)^4+x(3)^2)*(x(1)-1);
32list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
33
34ring r = 0,(x(1..3)),dp(3);            //E8                  49 sec  51 Karten
35ideal J=(x(1)^3-x(2)^5+x(3)^2)*(x(1)-1);
36//list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
37//!!! Laeuft noch nicht durch --- zu dick
38
39/* nicht Aequidim.
40ring r = 0,(x(1..3)),dp(3);            //U8                  10 sec  11 Karten
41ideal J=(x(3)^3+x(1)^2+x(2)*x(3),x(1)*x(2))*(x(1)-1)^2;
42list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
43*/
44
45//=====W#[1,2]
46ring r = 0,(x(1..3)),dp;
47ideal J=(x(2)^2-x(1)^3)^2-4*x(1)^5*x(2)-x(1)^7-x(3)^2;
48list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
49//tst_status(1);$
50
51//=====arti1
52ring r = 0,(x(1..3)),dp;
53ideal J=(x(1)^2-x(2)^3)*((x(1)-1)^2+(x(2)-1)^3)-x(3)^2;
54list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
55
56//=====arti2
57ring r = 0,(x(1..3)),dp;
58ideal J=(x(1)^2-x(2)^3)*((x(1)-1)^2-(x(2)-1)^3)-x(3)^2;
59list L=resolve(J,1,"L");size(L[1]);kill L;kill r;
60
61
Note: See TracBrowser for help on using the repository browser.