Abstract
The algorithm and its proof is a highly generalized version of the algorithm which determines the resolution graph of cyclic coverings. Its origin goes back to the case of suspensions, when one starts with an isolated plane curve singularity \(f^{\prime}\) and a positive integer n, and one determines the resolution graph of the hypersurface singularity\(\{f^{\prime}(x,y)+z^n=0\}\) from the embedded resolution graph of \(f^{\prime}\) and the integer n; see 5.3.
Keywords
- Singular Point
- Double Point
- Tubular Neighbourhood
- Local Equation
- Singular Locus
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Némethi, A., Szilárd, Á. (2012). Proof of the Main Algorithm. In: Milnor Fiber Boundary of a Non-isolated Surface Singularity. Lecture Notes in Mathematics(), vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23647-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-23647-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23646-4
Online ISBN: 978-3-642-23647-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
