Symmetric semi-perfect obstruction theory revisited
Abstract
In this paper we survey some results on the symmetric semi-perfect obstruction theory on a Deligne-Mumford stack X constructed by Chang-Li, and Behrend's theorem equating the weighted Euler characteristic of X and the virtual count of X by symmetric semi-perfect obstruction theories. As an application, we prove that Joyce's d-critical scheme admits a symmetric semi-perfect obstruction theory, which can be applied to the virtual Euler characteristics by Jiang-Thomas.
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.