Related papers: Simple Hironaka resolution in characteristic zero

Let $X$ be any variety in characteristic zero. Let $V \subset X$ be an open subset that has toroidal singularities. We show the existence of a canonical desingularization of $X$ except for V. It is a morphism $f: Y \to X$ , which does not…

We study the concept of canonical characteristic set of a characterizable differential ideal. We propose an efficient algorithm that transforms any characteristic set into the canonical one. We prove the basic properties of canonical…

This paper presents a Hamiltonian reduction procedure for field theories over affine principal bundles introducing a canonical identification to describe the reduced multisymplectic space without the introduction of a connection. The main…

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…

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

Hironaka's concept of characteristic polyhedron of a singularity has been one of the most powerful and fruitful ideas of the last decades in singularity theory. In fact, since then combinatorics have become a major tool in many important…

This article contains an elementary constructive proof of resolution of singularities in characteristic zero. Our proof applies in particular to schemes of finite type and to analytic spaces (so we recover the great theorems of Hironaka).…

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…

Let $X$ be a closed subscheme embedded in a scheme $W$ smooth over a field ${\bf k}$ of characteristic zero, and let ${\mathcal I}(X)$ be the sheaf of ideals defining $X$. Assume that the set of regular points of $X$ is dense in $X$. We…

Let $X$ be a fs logarithmic scheme that is generically logarithmically smooth, and that admits a strict closed embedding into a logarithmically smooth scheme $Y$ over a field $\kk$ of characteristic zero. We construct a simple and fast…

We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation…

The 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…

Updated version. Includes comments on the advances in the field from the Kyoto workshop on Resolution of Singularities in Positive Characteristic, December 2008. The article surveys the theory of kangaroo points as they appear in the…

In this paper, we prove that every binomial ideal in a polynomial ring over an algebraically closed field of characteristic zero admits a canonical primary decomposition into binomial ideals. Moreover, we prove that this special…

We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and…

We introduce the class of principal symmetric ideals, which are ideals generated by the orbit of a single polynomial under the action of the symmetric group. Fixing the degree of the generating polynomial, this class of ideals is…

Given an ideal $\mathcal I$ on a variety $X$ with toroidal singularities, we produce a modification $X' \to X$, functorial for toroidal morphisms, making the ideal monomial on a toroidal stack $X'$. We do this by adapting the methods of…

A short proof of the "Rigidity theorem" using the sheaf theoretic model for Hilbert modules over polynomial rings is given. The joint kernel for a large class of submodules is described. The completion $[\mathcal I]$ of a homogeneous…

These are the notes for my lecture ``Resolution of Sigularities in Charcteristic 0" given at the AMS Summer Institute at Seattle. It gives a self contained proof of the strong Hironaka resolution theorem.

This short paper presents saturation-based algorithms for homogenization and elimination. This algorithm can compute elimination ideals by using syzygies and ideal membership test, hence it works with any} monomial order, in particular…