Abstract
We study definite fillings of lens spaces. We classify the lens spaces for which every smooth negative-definite filling satisfies where denotes the canonical negative-definite plumbing. The classification is given by 17 "forbidden configurations" that cannot appear as induced subgraphs of the canonical plumbing graph. More generally, we introduce a combinatorial framework that encodes the lattice embedding information coming from the dual plumbing of , and we prove that it is governed by a finite set of minimal forbidden configurations. We also discuss consequences for symplectic fillings of lens spaces and for smoothings of cyclic quotient singularities.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.