Computing A1-Euler numbers with Macaulay2
Abstract: We use Macaulay2 for several enriched counts in GW(k). First, we compute the count of lines on a general cubic surface using Macaulay2 over Fp in GW(Fp) for p a prime number and over the rational numbers Q in GW(Q). This gives a new proof for the fact that the count of lines on a cubic surface is 3+12h in GW(k) where h denotes the hyperbolic form. Then, we compute the count of lines in P3 meeting 4 general lines, the count of lines on a quadratic surface meeting one general line and the count of singular elements in a pencil of degree d-surfaces. Finally, we provide code to compute the EKL-form and compute several A1-Milnor numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.