fieker-DuValspielwiese
Last change
on this file since 894057 was
894057,
checked in by Oleksandr Motsak <motsak@…>, 13 years ago
|
ADD: Tests from online manual (res+stat on mamawutz): short ones Tst/Manual/s.lst
|
-
Property mode set to
100644
|
File size:
613 bytes
|
Line | |
---|
1 | LIB "tst.lib"; tst_init(); |
---|
2 | LIB "dmod.lib"; |
---|
3 | ring r = 0,(x,y),ds; |
---|
4 | poly f1 = x*y*(x+y); |
---|
5 | ideal I1 = bernstein(f1)[1]; // a local Bernstein poly |
---|
6 | I1; |
---|
7 | minIntRoot(I1,0); |
---|
8 | poly f2 = x2-y3; |
---|
9 | ideal I2 = bernstein(f2)[1]; |
---|
10 | I2; |
---|
11 | minIntRoot(I2,0); |
---|
12 | // now we illustrate the behaviour of factorize |
---|
13 | // together with a global ordering |
---|
14 | ring r2 = 0,x,dp; |
---|
15 | poly f3 = 9*(x+2/3)*(x+1)*(x+4/3); //global b-polynomial of f1=x*y*(x+y) |
---|
16 | ideal I3 = factorize(f3,1); |
---|
17 | I3; |
---|
18 | minIntRoot(I3,1); |
---|
19 | // and a more interesting situation |
---|
20 | ring s = 0,(x,y,z),ds; |
---|
21 | poly f = x3 + y3 + z3; |
---|
22 | ideal I = bernstein(f)[1]; |
---|
23 | I; |
---|
24 | minIntRoot(I,0); |
---|
25 | tst_status(1);$ |
---|
Note: See
TracBrowser
for help on using the repository browser.