Abstract
The task of resolution of singularities has been one of the central topics in Algebraic
Geometry for many decades. After results in low dimension in the first half of the 20th
century, it was Hironaka's monumental article in 1964 which solved the porblem in the
general case in chareacteristic zero. The case of characteristic $p > 0$ is still unsolved
except in partial results in low dimension.
But Hironaka's proof did not put an end to the interest in characteric zero, instead it shifted
the focus toward the task of finding a more constructive approach. Such algorithmic
approaches appeared at the end of the 1980's independently by Villamayor and by
Bierstone and Milman. In this talk we consider the computational tasks arising from
Villamayor's algorithm and present an implementation.
BibTeX - Entry
@InProceedings{fruhbiskruger:DagSemProc.06271.7,
author = {Fr\"{u}hbis-Kr\"{u}ger, Anne},
title = {{Computational Aspects of the Resolution of Singularities}},
booktitle = {Challenges in Symbolic Computation Software},
pages = {1--8},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6271},
editor = {Wolfram Decker and Mike Dewar and Erich Kaltofen and Stephen Watt},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/771},
URN = {urn:nbn:de:0030-drops-7713},
doi = {10.4230/DagSemProc.06271.7},
annote = {Keywords: Resolution of Singularities, algorithmic desingularization,}
}
|
Keywords: |
|
Resolution of Singularities, algorithmic desingularization, |
|
Collection: |
|
06271 - Challenges in Symbolic Computation Software |
|
Issue Date: |
|
2006 |
|
Date of publication: |
|
25.10.2006 |
Creative Commons Attribution 4.0 International license (CC BY 4.0)