Post new topic Reply to topic  [ 1 post ] 
Author Message
 Post subject: An algorithm going over Newton diagrams
PostPosted: Tue Mar 11, 2014 5:03 pm 

Joined: Mon Jun 29, 2009 1:51 pm
Posts: 20
For the Newton-non-degenerate singularities many invariants are computable in terms of the Newton diagrams. Thus the natural way to check some guesses (and to look for counterexamples) is to go over all the Newton diagrams inside some Conv(x^N,y^N,z^N).

As the number of such diagrams grows exponentially, one needs some effective/fast algorithm. I wonder, what are the known algorithms? (if any) Is there something written in Singular?


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

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 Sun Dec 17, 2017 9:21 pm
cron
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group