Computing A^1-Euler numbers with Macaulay2

Motivic cohomology; motivic homotopy theory (14F42) Other nonalgebraically closed ground fields in algebraic geometry (14G27) Classical problems, Schubert calculus (14N15) Computational aspects of algebraic surfaces (14Q10)

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.

Review text

\(\mathbb{A}^1\)-enumerative geometry is a recent approach to enumerative geometry over non-closed fields. Rather than integer-valued counts, one obtains counts valued in the Grothendieck-Witt ring \(\mathrm{GW}(k)\) of isomorphism classes of symmetric, non-degenerate bilinear forms over the base field. The ring \(\mathrm{GW}(k)\) shows up as the \(\mathbb{A}^1\)-homotopy classes of self-maps of the motivic sphere \(\mathbb{P}^n/\mathbb{P}^{n-1}\) [\textit{F. Morel}, \(\mathbb{A}^1\)-algebraic topology over a field. Berlin: Springer (2012; Zbl 1263.14003)]. Tools like Euler classes and local Brouwer degrees admit analogs in \(\mathbb{A}^1\)-homotopy theory that, despite their homotopical origin, can be computed explicitly in terms of commutative algebra and algebraic geometry [\textit{J. L. Kass} and \textit{K. Wickelgren}, Duke Math. J. 168, No. 3, 429--469 (2019; Zbl 1412.14014); \textit{T. Bachmann} and \textit{K. Wickelgren}, J. Inst. Math. Jussieu 22, No. 2, 681--746 (2023; Zbl 1515.14037)]. In this article, the author provides a clearly written overview of the role of these tools in \(\mathbb{A}^1\)-enumerative geometry. She then demonstrates how one can use the Macaulay2 computer algebra software to compute \(\mathrm{GW}(k)\)-valued Euler numbers and local degrees. This makes computations in \(\mathbb{A}^1\)-enumerative geometry quite accessible. For example, it would be feasible to design a vertically-integrated research project on some \(\mathbb{A}^1\)-enumerative problem, where an undergraduate or early graduate student is tasked with generating some data or exploring examples in Macaulay2. Such a project would give the student concrete computational tasks to work on while they learn the relevant theory in algebraic geometry or homotopy theory. It is also worth mentioning the forthcoming package \texttt{A1BrouwerDegrees} for Macaulay2, which is being developed by Borisov, Brazelton, Espino, Hagedorn, Han, Lopez Garcia, Louwsma, and Tawfeek. This package will implement the commutative algebraic formula given in [\textit{T. Brazelton} et al., Algebra Number Theory 17, No. 11, 1985--2012 (2023; Zbl pending)] for computing \(\mathbb{A}^1\)-degrees, making the examples in the paper under review even more readily available.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Computing \(\mathbb{A}^1\)-Euler numbers with Macaulay2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6162755)