On the Lagrangian fillability of almost positive links
Abstract
In this paper, we prove that a link which has an almost positive diagram with a certain condition is Lagrangian fillable.
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.