Proof of the Main Algorithm

  • András Némethi
  • Ágnes Szilárd
Part of the Lecture Notes in Mathematics book series (LNM, volume 2037)


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.


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.lfréd Rényi Institute of MathematicsHungarian Academy of SciencesBudapestHungary

Personalised recommendations