Syzygies, Finite Length Modules, and Random Curves
Syzygies, finite length modules, and random curves Christine Berkesch and Frank-Olaf Schreyer∗ Abstract We apply the theory of Gr¨obner bases to the computation of free reso- lutions over a polynomial ring, the defining equations of a canonically em- bedded curve, and the unirationality of the moduli space of curves of a fixed small genus. Introduction While a great deal of modern commutative algebra and algebraic geometry has taken a nonconstructive form, the theory of Gr¨obner bases provides an algorithmic approach. Algorithms currently implemented in computer algebra systems, such as Macaulay2 and SINGULAR, already exhibit the wide range of computational possibilities that arise from Gr¨obner bases [M2, DGPS]. In these lectures, we focus on certain applications of Gr¨obner bases to syzy- gies and curves. In Section 1, we use Gr¨obner bases to give an algorithmic proof arXiv:1403.0581v2 [math.AC] 10 Sep 2014 of Hilbert’s Syzygy Theorem, which bounds the length of a free resolution over a polynomial ring. In Section 2, we prove Petri’s theorem about the defining equa- tions for canonical embeddings of curves. We turn in Section 3 to the Hartshorne– Rao module of a curve, showing by example how a module M of finite length can be used to explicitly construct a curve whose Hartshorne–Rao module is M. Sec- tion 4 then applies this construction to the study of the unirationality of the moduli space Mg of curves of genus g. 2010 Mathematics Subject Classification 13P10, 13D05, 13C40, 14H10, 14-04, 14M20, 14Q05. ∗This article consists of extended notes from lectures by the second author at the Joint Intro- ductory Workshop: Cluster Algebras and Commutative Algebra at MSRI during the Fall of 2012.
[Show full text]