论文信息 - A Computer Program for the Resolution of Singularities

A Computer Program for the Resolution of Singularities

Since recently we have constructive proofs for resolution of singularities in characteristic zero (see [V1, V2, BM1, BM2, EV]). These proofs do contain, at least implicitly, algorithms for computing the desingularization automatically. The authors have implemented an algorithm based on [EV] in Maple V R5.

Josef Schicho | Gábor Bodnár | J. Schicho | G. Bodnár

[1] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[2] B. Buchberger. An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[3] Orlando E. Villamayor,et al. Constructiveness of Hironaka's resolution , 1989 .

[4] Carlo Traverso,et al. Effective methods in algebraic geometry , 1991 .

[5] Edward Bierstone,et al. A simple constructive proof of Canonical Resolution of Singularities , 1991 .

[6] Heinz Kredel,et al. Gröbner Bases: A Computational Approach to Commutative Algebra , 1993 .

[7] Edward Bierstone,et al. Canonical desingularization in characteristic zero by blowing up the maximum strata of a local invariant , 1995 .

[8] Villamayor U. Orlando. Introduction to the Algorithm of Resolution , 1996 .

[9] Santiago Encinas,et al. A Course on Constructive Desingularization and Equivariance , 2000 .

[10] Josef Schicho,et al. Automated Resolution of Singularities for Hypersurfaces , 2000, J. Symb. Comput..