Desingularization algorithms I. Role of exceptional divisors

Simple item page
dc.creatorBierstone, Edward
dc.creatorMilman, Pierre D.
dc.date2002-07-11
dc.date.accessioned2026-07-07T04:49:38Z
dc.date.available2026-07-07T04:49:38Z
dc.descriptionThe article is about a "desingularization principle" common to various canonical desingularization algorithms in characteristic zero, and the roles played by the exceptional divisors in the underlying local construction. We compare algorithms of the authors and of Villamayor and his collaborators, distinguishing between the fundamental effect of the way the exceptional divisors are used, and different theorems obtained because of flexibility allowed in the choice of "input data". We show how the meaning of "invariance" of the desingularization invariant, and the efficiency of the algorithm depend on the notion of "equivalence" of collections of local data used in the inductive construction.
dc.description66 pages
dc.identifierhttps://arxiv.org/abs/math/0207098
dc.identifierhttp://arxiv.org/abs/math/0207098
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64497
dc.subjectAlgebraic Geometry
dc.subjectComplex Variables
dc.subject14E15; 32S45
dc.titleDesingularization algorithms I. Role of exceptional divisors
dc.typetext

Files

Collections

arXiv