A FINITENESS THEOREM FOR DUAL GRAPHS OF SURFACE SINGULARITIES
PATRICK POPESCU-PAMPU, JOSÉ SEADE
Source record
Source: Crossref
Published: Aug 1, 2009
DOI: 10.1142/s0129167x09005649
Open original source ↗Source abstract
Consider a fixed connected, finite graph Γ and equip its vertices with weights p i which are non-negative integers. We show that there is a finite number of possibilities for the coefficients of the canonical cycle of a numerically Gorenstein surface singularity having Γ as the dual graph of the minimal resolution, the weights p i of the vertices being the arithmetic genera of the corresponding irreducible components. As a consequence we get that if Γ is not a cycle, then there is a finite number of possibilities of self-intersection numbers which one can attach to the vertices which are of valency ≥ 2, such that one gets the dual graph of the minimal resolution of a numerically Gorenstein surface singularity. Moreover, we describe precisely the situations when there exists an infinite number of possibilities for the self-intersections of the component corresponding to some fixed vertex of Γ.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.