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 - Trying to compute the monodromy (how to speed it up?)
Author Message
Dmitry
  Post subject:  Trying to compute the monodromy (how to speed it up?)  Reply with quote
Hi,

I'm trying to compute the Jordan structure of monodromy for a moderately complicated function. After one-night-work Singular was still in the process. Is there some way to speed up?

here's my code:

LIB "sing.lib";
LIB "gmssing.lib";
ring r=0,(x,y,z),ds;
int t=3;
poly g=y^2*(x+z-y)^2*z^2+(x+y)*(y+3x-z)*(x+z-t*y)*(x-t*y-7z)*(11x+y-z)*(x+3y);
poly f=g+x^7+y^7+z^7;
milnor(f);
monodromy(f);

Unfortunately gmssing.lib enforces zero characteristic. Any other tricks?
Post Posted: Thu Aug 04, 2011 10:32 am


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