Back to Forum  View unanswered posts  View active topics
Topic review  An algorithm going over Newton diagrams 
Author 
Message 


Post subject: 
An algorithm going over Newton diagrams 


For the Newtonnondegenerate 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 Newtonnondegenerate 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
