arXiv · 1206.3090
Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic)
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).
Explore related subjects
Keep this discovery
Edward Bierstone, Dima Grigoriev, Pierre Milman, Jaroslaw Wlodarczyk. 2012-06-14. Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic). https://arxiv.org/abs/1206.3090
Cite the original work for its findings. Save a collection to share your selection of sources.