2004
DOI: 10.1090/conm/354/06481
|View full text |Cite
|
Sign up to set email alerts
|

Invariants of normal surface singularities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
80
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 43 publications
(81 citation statements)
references
References 0 publications
1
80
0
Order By: Relevance
“…After normalization and desingularization, and finally blowing down the rational (−1)-curves, we get the minimal resolution of the singularity (S, 0) with the following properties (cf. [16,17] Topological data of the smoothing. We start with a short generic discussion about the computation of topological data of the Milnor fiber of a hypersurface singularity.…”
Section: An Examplementioning
confidence: 99%
“…After normalization and desingularization, and finally blowing down the rational (−1)-curves, we get the minimal resolution of the singularity (S, 0) with the following properties (cf. [16,17] Topological data of the smoothing. We start with a short generic discussion about the computation of topological data of the Milnor fiber of a hypersurface singularity.…”
Section: An Examplementioning
confidence: 99%
“…For the extension of the conjecture [12] to arbitrary spin c structures, see [11]. For different definitions regarding surface singularities, the reader is invited to consult [10].…”
Section: Problem IVmentioning
confidence: 99%
“…For example, the following graph Γ has these properties: 7 Generalities about computation sequences 7.1 The computation of the groups H (see Section 9) is based on the techniques of computation sequences (see, for example, [5,6,9,23]). These objects were successfully used in the study of the (resolution of) normal surface singularities (see [10] for more details). Some of the next statements and proofs rhyme perfectly with some of those computations, eg with the proof of the existence of Artin's fundamental cycle, with Laufer's algorithm which provides this fundamental cycle, or with the construction of Yau's elliptic sequence.…”
Section: Remarkmentioning
confidence: 99%
See 2 more Smart Citations