# Singular

 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
 Font size: Tiny Small Normal Large Huge Font colour [quote="Dmitry"]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?[/quote]
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 - An algorithm going over Newton diagrams
Author Message
 Dmitry
 Post subject: An algorithm going over Newton diagrams
 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? 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?
 Posted: Tue Mar 11, 2014 5:03 pm

 It is currently Sat Oct 20, 2018 5:07 pm