spielwiese
|
Last change
on this file since 56c0fe was
293722,
checked in by Viktor Levandovskyy <levandov@…>, 14 years ago
|
|
*levandov: tests for new functions in doc, for plural
git-svn-id: file:///usr/local/Singular/svn/trunk@12656 2c84dea3-7e68-4137-9b89-c4e89433aadc
|
-
Property mode set to
100644
|
|
File size:
647 bytes
|
| Line | |
|---|
| 1 | LIB "tst.lib"; |
|---|
| 2 | tst_init(); |
|---|
| 3 | LIB "dmod.lib"; |
|---|
| 4 | ring r = 0,(x,y),dp; |
|---|
| 5 | poly f = x^3+xy; |
|---|
| 6 | def S = Sannfs(f); setring S; // compute the annihilator of f^s |
|---|
| 7 | LD; // is not a Groebner basis yet! |
|---|
| 8 | poly f = imap(r,f); |
|---|
| 9 | poly P = f*Dx-s*diff(f,x); |
|---|
| 10 | division(P,LD); // so P is in the ideal via the cofactors in _[1] |
|---|
| 11 | ideal I = LD, f; // consider a bigger ideal |
|---|
| 12 | list L = division(s^2, I); // the normal form is -2s-1 |
|---|
| 13 | L; |
|---|
| 14 | // now we show that the formula above holds |
|---|
| 15 | matrix M[1][1] = s^2; matrix N = matrix(I); |
|---|
| 16 | matrix T = matrix(L[1]); matrix R = matrix(L[2]); matrix U = matrix(L[3]); |
|---|
| 17 | transpose(U)*transpose(M) - transpose(T)*transpose(N) - transpose(R); |
|---|
| 18 | tst_status(1);$ |
|---|
Note: See
TracBrowser
for help on using the repository browser.
