paper

Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic)

arXiv:1206.3090

Abstract

Building upon works of Hironaka, Bierstone-Milman, Villamayor and Wlodarczyk, 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 canonical Hironaka embedded desingularization and principalization over fields of large characteristic (relative to the degrees of generating polynomials).

arXiv comment1 figure. arXiv admin note: substantial text overlap with arXiv:math/0401401

References in corpus (2)

Cited by in corpus (1)