source: git/Tst/Manual/Depth.tst @ c2f6bd

spielwiese
Last change on this file since c2f6bd was 6051d87, checked in by Oleksandr Motsak <motsak@…>, 12 years ago
FIX: Manual examples need adaptation to be tests (due to HW/build-dependent output)
  • Property mode set to 100644
File size: 1.0 KB
Line 
1LIB "tst.lib"; tst_init();
2  LIB "matrix.lib"; LIB "sing.lib";
3  int n = 4;
4  int m = 3;
5  int N = n*(n+1) div 2;       // will become number of variables
6  ring R = 32003,x(1..N),dp;
7  matrix X = symmat(n);        // proc from matrix.lib
8                               // creates the symmetric generic nxn matrix
9  print(X);
10  ideal J = minor(X,m);
11  J=std(J);
12  // Kaehler differentials D_k(R)
13  // of R=k[x1..xn]/J:
14  module D = J*freemodule(N)+transpose(jacob(J));
15  ncols(D);
16  nrows(D);
17  //
18  // Note: D is a submodule with 110 generators of a free module
19  // of rank 10 over a polynomial ring in 10 variables.
20  // Compute a full resolution of D with sres.
21  // This takes about 17 sec on a Mac PB 520c and 2 sec an a HP 735
22  int time = timer;
23  module sD = std(D);
24  list Dres = sres(sD,0);                // the full resolution
25//  timer-time;                            // time used for std + sres
26  intmat B = betti(Dres);
27  print(B,"betti");
28  N-ncols(B)+1;                          // the desired depth
29tst_status(1);$
Note: See TracBrowser for help on using the repository browser.