A finiteness theorem for dual graphs of surface singularities

Abstract

Consider a fixed connected, finite graph and equip its vertices with weights pi 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 pi 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 .

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…