Abstract
We provide an algorithm that allows to describe the minimal log-resolution of an ideal in a smooth complex surface from the minimal log-resolution of its generators. In order to make this algorithm effective we present a modified version of the Newton–Puiseux algorithm that computes the Puiseux decomposition of a product of not necessarily reduced or irreducible elements together with their algebraic multiplicity in each factor.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
