Post new topic Reply to topic  [ 3 posts ] 
Author Message
 Post subject: Compute the generic initial ideal
PostPosted: Thu Feb 28, 2008 11:08 am 

Joined: Thu Feb 28, 2008 7:16 am
Posts: 1
Hi!
I am a beginner of Singular
I want to compute the generic initial ideal. but I can't compute that in Singular!
How can I compute the generic initial ideal in Singular?

Thanks!


Report this post
Top
 Profile  
Reply with quote  
 Post subject: Re: Compute the generic initial ideal
PostPosted: Sun Jul 19, 2009 4:33 pm 

Joined: Thu Aug 11, 2005 8:03 pm
Posts: 40
Location: RWTH Aachen, Germany
Hi, up to now there was no command in Singular to
compute the gin. But according to the tutorial paper of Mark Green and Michael Stillman (from the book "Groebner bases and Applications", Cambridge University Press, 1998), it can be coded in Singular as follows:

Code:
LIB "random.lib";
LIB "poly.lib";
proc gin(ideal I)
{
matrix M = randommat(1,nvars(basering), maxideal(1), 1000); // the random coeffs will be in range [-1000,1000]
ideal m = ideal(M); map F = basering, m;
ideal J = F(I);
J = groebner(J);
J = normalize(lead(J));
return(J);
}


For instance, try the examples from the tutorial:
Code:
// for revlex gin:
ring r = 0,(a,b,c,d),dp;
ideal I = a^3+c^2*d, b^3-a*d^2;
gin(I);


Code:
// for lex gin:
ring r = 0,(a,b,c,d),lp;
ideal I = a^3+c^2*d, b^3-a*d^2;
gin(I); // be patient, it takes some time


This agrees with the answers, computed e.g. with Macaulay2.

Regards,
Viktor Levandovskyy


Report this post
Top
 Profile  
Reply with quote  
 Post subject: Re: Compute the generic initial ideal
PostPosted: Mon Jul 20, 2009 10:57 am 

Joined: Fri Dec 05, 2008 4:48 pm
Posts: 5
You may use the function randomid from random.lib as follows:
Code:
LIB "random.lib";
ring r = 0,(a,b,c,d),dp;
ideal I = a^3+c^2*d, b^3-a*d^2;
ideal J=randomid(I,2,100);

This will give you an ideal with two random generators which are random linear combinations of generators of I with coefficients in [-100,100].
More info in http://www.singular.uni-kl.de/Manual/latest/sing_751.htm#SEC828

_________________
Dr. Stanislav Bulygin
Post Doctoral researcher
Working group Cryptographic Primitives
Department Secure Data
Center for Advanced Security Reseach Darmstadt
http://www.mathematik.uni-kl.de/~bulygin/


Report this post
Top
 Profile  
Reply with quote  
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 3 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 11:05 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group