Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic)
Algebraic Geometry
2012-06-15 v1
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).
Cite
@article{arxiv.1206.3090,
title = {Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic)},
author = {Edward Bierstone and Dima Grigoriev and Pierre Milman and Jaroslaw Wlodarczyk},
journal= {arXiv preprint arXiv:1206.3090},
year = {2012}
}
Comments
1 figure. arXiv admin note: substantial text overlap with arXiv:math/0401401