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 - Computing minimal resolutions of graded modules
Author Message
  Post subject:  Re: Computing minimal resolutions of graded modules  Reply with quote
you could try using the following new feature (probably in the development version of Singular - spielwiese)


New orderings for modules

Quote:
One can assign weights to module components, when defining a monomial ordering. For example

Code:
ring R = 0, (x,y,z), (am(1,2,3,   10,20,30,40), dp, C);
deg(x*gen(1));
==> 11


will assign weights 1,2,3 to x,y,z respectively, and weights 10,20,30,40,0,0,... to components of any free module defined over R. This ordering will first sort by this weighted degree, then by dp on the ring monomials and then will give priority to the large component index.
Post Posted: Tue Aug 06, 2013 1:44 pm
  Post subject:  Computing minimal resolutions of graded modules  Reply with quote
Hello,

First of all: thank you very much for developing this great software!

I'm having trouble handling graded modules and computing their minimal resolutions:

1) How can I assign gradings to the generators in a free module over a graded polynomial ring?
2) I tried to compute the minimal resolution of the graded module Q[a]*e + Q[a] * f / (a*e+f) (with deg(a)=deg(f)=1, deg(e)=0), but didn't know how to define the gradings, and the ungraded approach

Code:
ring r = 0,a,lp;
matrix A[2][1] = 1,a;
module M = module(A);
resolution RES = mres(M,0);
RES;


suggested ranks 2 and 1 in the minimal resolution. Applying the function prune to the module, however, does eliminate the irrelevant generator f.

What am I doing wrong?

Thank you!
Hanno
Post Posted: Tue Aug 06, 2013 8:18 am


It is currently Fri May 13, 2022 11:02 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group