EFFECTIVE HIRONAKA RESOLUTION AND ITS COMPLEXITY (WITH APPENDIX ON APPLICATIONS IN POSITIVE CHARACTERISTIC)
Résumé
Building upon works of Hironaka, Bierstone-Milman, Villamayor and W lodarczyk we give an a priori estimate for the complexity of the simplified Hironaka algorithm. As a consequence of this result we show that there exists a canonical Hironaka embedded desingularization and principalization over the fields of large characteristic (relatively to degree of generating polynomials).
Domaines
Mathématiques [math]
Origine : Fichiers produits par l'(les) auteur(s)