Related papers: Effective Hironaka resolution and its Complexity (…
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…
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.…
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…
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…
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…
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…
We discuss Hironaka's theorem on resolution of singularities in charactetistic 0 as well as more recent progress, both on simplifying and improving Hironaka's method of proof and on new results and directions on families of varieties,…
We present a concise proof for the existence and construction of a {\it strong resolution of excellent schemes} of finite type over a field of characteristic zero. Our proof is based on earlier work of Villamayor, Encinas-Villamayor and…
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…
These expository notes, addressed to non-experts, are intended to present some of Hironaka's ideas on his theorem of resolution of singularities. We focus particularly on those aspects which have played a central role in the constructive…
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…
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…
An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…
Algorithms for resolution of singularities in characteristic zero are based on Hironaka's idea of reducing the problem to a simpler question of desingularization of an "idealistic exponent" (or "marked ideal"). How can we determine whether…
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…
We present an application of invariant polynomials in machine learning. Using the methods developed in previous work, we obtain two types of generators of the Lorentz- and permutation-invariant polynomials in particle momenta; minimal…
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…
The seminal concept of characteristic polygon of an embedded algebroid surface, first developed by Hironaka, seems well suited for combinatorially (perhaps even effectively) tracking of a resolution process. However, the way this object…
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…
In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…