Back to Forum | View unanswered posts | View active topics





Post a reply
Username:
Note:If not registered, provide any username. For more comfort, register here.
Subject:
Message body:
Enter your message here, it may contain no more than 60000 characters. 

Smilies
:D :) :( :o :shock: :? 8) :lol: :x :P :oops: :cry: :evil: :twisted: :roll: :wink: :!: :?: :idea: :arrow: :| :mrgreen:
Font size:
Font colour
Options:
BBCode is ON
[img] is ON
[flash] is OFF
[url] is ON
Smilies are ON
Disable BBCode
Disable smilies
Do not automatically parse URLs
Confirmation of post
To prevent automated posts the board requires you to enter a confirmation code. The code is displayed in the image you should see below. If you are visually impaired or cannot otherwise read this code please contact the %sBoard Administrator%s.
Confirmation code:
Enter the code exactly as it appears. All letters are case insensitive, there is no zero.
   

Topic review - About the number of generators of an ideal.
Author Message
levandov
  Post subject:  Re: About the number of generators of an ideal.  Reply with quote
Hello, Vinay Wagh

Quote:
> Hi!
>
> I am working over the ring R=0,(X,Y,Z),ds; And ideal
> Isubset R. I am interested in finding mu(I). For that
> initially I used the command minbase(). Then just for the
> verification I tried to find out the free reolution of
> it (using res and mres). (The answers were tallied.)


As far as we have understood, under mu(I) you mean the minimal number of generators. We avoid the use this notation, since the Milnor number is also denoted by mu(I).

Quote:
> Actually I am not interested in the actual generators
> which I get by minbase(). I just want mu(I).


You can write a procedure, returning the minimal number of generators. Note, that the "mimimal" makes sense only in the local or in the graded case.

Quote:
> Can somebody tell me the algorithm which Singular uses to
> compute mu(I) AND/OR res(I)? I tried to look @ the
> singular libraries, but it seems these commands are from
> the kernel. And I didnt have much patience to look @ the
> C++ source code :-(


This is explained in the SINGULAR book on the page 107, after the definition 2.1.33. The SINGULAR command "prune" provides you with the minimal presentation of a module.

Quote:
> Thanks in advance.
> Vinay Wagh
>


With best regards,
Viktor Levandovskyy and Christoph Lossen, SINGULAR Team
Post Posted: Thu Aug 11, 2005 8:22 pm
Vinay Wagh
  Post subject:  About the number of generators of an ideal.  Reply with quote
Hi!

I am working over the ring R=0,(X,Y,Z),ds; And ideal
Isubset R. I am interested in finding mu(I). For that
initially I used the command minbase(). Then just for the
verification I tried to find out the free reolution of
it (using res and mres). (The answers were tallied.)

Actually I am not interested in the actual generators
which I get by minbase(). I just want mu(I).

Can somebody tell me the algorithm which Singular uses to
compute mu(I) AND/OR res(I)? I tried to look @ the
singular libraries, but it seems these commands are from
the kernel. And I didnt have much patience to look @ the
C++ source code :-(

Thanks in advance.

Vinay Wagh


email: vinay_wagh@yahoo.com
Posted in old Singular Forum on: 2004-06-03 08:47:38+02
Post Posted: Thu Aug 11, 2005 5:32 pm


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