PublisherThe University of Arizona.
RightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
AbstractEnumerative geometry is the subfield of algebraic geometry concerned with counting the number of solutions to geometric questions. Classically one restricts to working over algebraically closed fields to get invariant answers to such problems. Enriched enumerative geometry uses tools from motivic homotopy theory (i.e., homotopy theory for schemes) to obtain invariant results over more general fields. In this paper, we give an overview of some standard techniques from enumerative geometry, both classical and enriched. We then restrict our attention to the problem of counting the number of lines of the complete intersection of two degree n − 2 hypersurfaces in Pnk when n is even.