Equations of \,M0,n
Abstract
Following work of Keel and Tevelev, we give explicit polynomials in the Cox ring of P1×·s×Pn-3 that, conjecturally, determine M0,n as a subscheme. Using Macaulay2, we prove that these equations generate the ideal for n=5, 6, 7, 8. For n ≤ 6 we give a cohomological proof that these polynomials realize M0,n as a projective variety, embedded in P(n-2)!-1 by the complete log canonical linear system.
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.