Post new topic Reply to topic  [ 2 posts ] 
Author Message
 Post subject: Vector space basis of the quotient of two ideals
PostPosted: Wed Nov 19, 2008 12:35 am 
Site Admin

Joined: Thu Nov 13, 2008 10:52 am
Posts: 26
How can I compute a vector space basis of the quotient of two ideals
using SINGULAR?
For example, let m be a maximal ideal and I an arbitrary
ideal in k[x_1,...,x_n]. I would like to compute a basis of
m^k / (m^{k+1} + I)
for increasing k.


Report this post
Top
 Profile  
Reply with quote  
 Post subject:
PostPosted: Wed Nov 19, 2008 12:36 am 
Site Admin

Joined: Thu Nov 13, 2008 10:52 am
Posts: 26
To compute only the dimension, codim (from sing.lib) is probably the
fastest. To compute a basis you can use modulo. Here is an example:

Code:
LIB"sing.lib";
ring r = 0,x(1..4),dp;
int k=4;
ideal i = sparseid(3,2,k-1,50,10);       //create a random sparse ideal
ideal m1 = maxideal(k);
attrib(m1,"isSB",1);
i = intersect(m1,i);                     //not necessary for modulo
ideal m2 = maxideal(k+1),i;
m2 = std(m2);                            //not necessary for modulo
codim(m1,m2);                            //computes the dimension
module m = std(modulo(m1,m2));
vdim(m);                                 //same as codim(m1,m2) but
                                         //with a different algorithm
matrix K = matrix(kbase(m));
matrix M1 = matrix(m1);
ideal B = M1*K;                          //the basis of m1/m2


For increasing k use a k-loop. Note that maxideal(k) will become rather big,
hence this will work only for small k (depending on I).


Report this post
Top
 Profile  
Reply with quote  
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 2 posts ] 

You can post new topics in this forum
You can reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

It is currently Fri May 13, 2022 10:56 am
cron
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group