1999
DOI: 10.1112/s0024610799007188
|View full text |Cite
|
Sign up to set email alerts
|

Symmetries of Surface Singularities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
1
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 31 publications
0
1
0
Order By: Relevance
“…If f belongs to a reductive algebraic subgroup G of Aut(Y ), then our result would follow since the Zariski closure of f in G is a subgroup isomorphic to C * acting effectively on Y , and a theorem of Scheja and Wiebe [SW81, Satz 3.1] implies Y to be a weighted homogeneous singularity, see [Mül99,Theorem 1]. If f is the time-one map of the flow of a holomorphic vector field having a dicritical singularity at 0, our theorem is then due to Camacho, Movasati and Scardua [CMS09].…”
Section: Introductionmentioning
confidence: 92%
“…If f belongs to a reductive algebraic subgroup G of Aut(Y ), then our result would follow since the Zariski closure of f in G is a subgroup isomorphic to C * acting effectively on Y , and a theorem of Scheja and Wiebe [SW81, Satz 3.1] implies Y to be a weighted homogeneous singularity, see [Mül99,Theorem 1]. If f is the time-one map of the flow of a holomorphic vector field having a dicritical singularity at 0, our theorem is then due to Camacho, Movasati and Scardua [CMS09].…”
Section: Introductionmentioning
confidence: 92%
“…The classification statements regarding topological types of normal surface singularities are important for some potential applications in our future work. In fact, these classes of singularities are the most interesting ones in the study of symmetries of surface singularities [21], since there is a natural homomorphism from the automorphism group of the singularities to the automorphism group of the central curve (that is, the −3-curve). Furthermore, we compute the fundamental cycles of maximal graphs.…”
Section: § 1 Introductionmentioning
confidence: 99%