Related papers: Functoriality in resolution of singularities

An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…

We formulate a resolution of singularities algorithm for analyzing the zero sets of real-analytic functions in dimensions $\geq 3$. Rather than using the celebrated result of Hironaka, the algorithm is modeled on a more explicit and…

We give a combinatorial algorithm for equivariant embedded resolution of singularities of a toric variety defined over a perfect field. The algorithm is realized by a finite succession of blowings-up with smooth invariant centres that…

Building upon work of Villamayor and Bierstone-Milman we give a proof of the canonical Hironaka principalization and desingularization. The idea of "homogenized ideals" introduced in the paper gives {\it a priori} the canonicity of…

We show that a version of the desingularization theorem of Hironaka holds for certain classes of infinitely differentiable functions (essentially, for subrings that exclude flat functions and are closed under differentiation and the…

The solution set of a system of polynomial equations typically contains ill-behaved, singular points. Resolution is a fundamental process in geometry in which we replace singular points with smooth points, while keeping the rest of the…

This paper is devoted to give all the technical constructions and definitions that will lead to the construction of an algorithm of resolution of singularities for binomial ideals. We construct a resolution function that will provide a…

This paper contains a short and simplified proof of desingularization over fields of characteristic zero, together with various applications to other problems in algebraic geometry (among others, the study of the behavior of…

Building upon ideas of Hironaka, Bierstone-Milman, Malgrange and others we generalize the inverse and implicit function theorem (in differential, analytic and algebraic setting) to sets of functions of larger multiplicities (or ideals).…

Two main algorithmic approaches are known for making Hironaka's proof of resolution of singularities in characteristic zero constructive. Their main difference is the use of different notions of transforms during the resolution process and…

Let $k$ be a field of characteristic zero. By using Hironaka's desingularisation theorem, we prove an extension criterion for a functor defined on nonsingular k-schemes and taking values on a category of complexes. Roughly speaking, the…

This paper represents the main portion of the Ph.D. Thesis of the author, and is the first of the series of four papers, which is a joint work with K. Matsuki as a whole. We present a program toward constructing an algorithm for resolution…

In this paper we construct a combinatorial algorithm of resolution of singularities for binomial ideals, over a field of arbitrary characteristic. This algorithm is applied to any binomial ideal. This means ideals generated by binomial…

We present a proof of embedded desingularization for closed subschemes which does not make use of Hilbert-Samuel function and avoids Hironaka's notion of normal flatness. This proof, already sketched in [A course on constructive…

This article is an exposition of an elementary constructive proof of canonical resolution of singularities in characteristic zero, presented in detail in Invent. Math. 128 (1997), 207-302. We define a new local invariant and get an…

These are introductional notes to resolution of singularities and Log principalization of ideals over fields of characteristic zero. We refer to `A simplified proof of desingularization and applications', A. Bravo, S. Encinas and O.…

The paper is motivated on the open problem of resolution of singularities in positive characteristic. The aim is to present a form of induction which is different from that used by Hironaka. In characteristic zero induction is formulated by…

Conventional ways to solve optimization problems on low-rank matrix sets which appear in great number of applications ignore its underlying structure of an algebraic variety and existence of singular points. This leads to appearance of…

By Hironaka Desingularization Theorem, any real analytic function has only normal crossing singularities after a suitable modification. We focus on the analytic equivalence of such functions with only normal crossing singularities. We prove…

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…