source: git/Tst/Manual/minIntRoot.tst @ 894057

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 
1LIB "tst.lib"; tst_init();
2LIB "dmod.lib";
3ring r   = 0,(x,y),ds;
4poly f1  = x*y*(x+y);
5ideal I1 = bernstein(f1)[1]; // a local Bernstein poly
6I1;
7minIntRoot(I1,0);
8poly  f2  = x2-y3;
9ideal I2  = bernstein(f2)[1];
10I2;
11minIntRoot(I2,0);
12// now we illustrate the behaviour of factorize
13// together with a global ordering
14ring r2  = 0,x,dp;
15poly f3   = 9*(x+2/3)*(x+1)*(x+4/3); //global b-polynomial of f1=x*y*(x+y)
16ideal I3 = factorize(f3,1);
17I3;
18minIntRoot(I3,1);
19// and a more interesting situation
20ring  s  = 0,(x,y,z),ds;
21poly  f  = x3 + y3 + z3;
22ideal I  = bernstein(f)[1];
23I;
24minIntRoot(I,0);
25tst_status(1);$
Note: See TracBrowser for help on using the repository browser.