source: git/Tst/Manual/proximitymatrix.tst @ 6fb723

spielwiese
Last change on this file since 6fb723 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: 931 bytes
Line 
1LIB "tst.lib"; tst_init();
2LIB "alexpoly.lib";
3ring r=0,(x,y),ls;
4poly f1=(y2-x3)^2-4x5y-x7;
5poly f2=y2-x3;
6poly f3=y3-x2;
7list proximity=proximitymatrix(f1*f2*f3);
8/// The proximity matrix P ///
9print(proximity[1]);
10/// The proximity resolution graph N ///
11print(proximity[2]);
12/// They satisfy N=-transpose(P)*P ///
13print(-transpose(proximity[1])*proximity[1]);
14/// The incidence matrix of the Enriques diagram ///
15print(proximity[3]);
16/// If M is the matrix of multiplicities and TM the matrix of total
17/// multiplicities of the singularity, then  M=P*TM.
18/// We therefore calculate the (total) multiplicities. Note that
19/// they have to be slightly extended.
20list MULT=extend_multiplicities(totalmultiplicities(f1*f2*f3));
21intmat TM=MULT[1];  // Total multiplicites.
22intmat M=MULT[2];   // Multiplicities.
23/// Check: M-P*TM=0.
24M-proximity[1]*TM;
25/// Check: inverse(P)*M-TM=0.
26intmat_inverse(proximity[1])*M-TM;
27tst_status(1);$
Note: See TracBrowser for help on using the repository browser.