Forbidden configurations and definite fillings of lens spaces

Abstract

We study definite fillings of lens spaces. We classify the lens spaces L(p,q) for which every smooth negative-definite filling X satisfies \[ b2(X) b2(X(p,q))-1, \] where X(p,q) 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 X(p,q), 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…