1989
DOI: 10.24033/asens.1573
|View full text |Cite
|
Sign up to set email alerts
|

Constructiveness of Hironaka's resolution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
151
0

Year Published

1998
1998
2012
2012

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 157 publications
(151 citation statements)
references
References 2 publications
(3 reference statements)
0
151
0
Order By: Relevance
“…In particular, simple singularities are a generalization of functions locally given by a monomial. Note that getting locally a monomial is the main objective in the problem of reduction of singularities of varieties, both in zero and positive characteristic [15], [1], [28], [29], [4]. However for the saddle-nodes, that correspond to λ = 0, the leaves are far from being comparable to the level sets of a function.…”
Section: Simple Singularities In Dimension Twomentioning
confidence: 99%
“…In particular, simple singularities are a generalization of functions locally given by a monomial. Note that getting locally a monomial is the main objective in the problem of reduction of singularities of varieties, both in zero and positive characteristic [15], [1], [28], [29], [4]. However for the saddle-nodes, that correspond to λ = 0, the leaves are far from being comparable to the level sets of a function.…”
Section: Simple Singularities In Dimension Twomentioning
confidence: 99%
“…We can repeat the process only finitely many times, since after each blowup the value of the strand of invariants strictly drops and since the set of its values satisfies the descending chain condition, leading to the termination of the algorithm. (See, e.g., [Vil89] Mk07] for details of the construction of the strand of invariants and the corresponding modifications in the classical setting. )…”
Section: Crash Course On the Existing Algorithm(s) In Characteristic mentioning
confidence: 99%
“…Different constructive proofs, following Hironaka's approach, appear in [7], [16], and in [27] (see also [28]). Each one of these proofs provides an algorithm of desingularization which indicates where to blow-up in order to eliminate the singularities in a step by step procedure.…”
Section: Introductionmentioning
confidence: 99%