Lazy tournaments, slide rules, and multidegrees of projective embeddings of M_{0,n}-bar

Abstract: We present a combinatorial algorithm on trivalent trees that we call a lazy tournament, which gives rise to a new geometric interpretation of the multidegrees of a projective embedding of the moduli space M_{0,n}-bar of stable n-marked genus 0 curves. We will show that the multidegrees are enumerated by disjoint sets of boundary points of the moduli space that can be seen to total (2n-7)!!, giving a natural proof of the value of the total degree. These sets are compatible with the forgetting maps used to derive the previously known recursion for the multidegrees.

As time permits, we will discuss an alternative combinatorial construction of (non-disjoint) sets of boundary points that enumerate the multidegrees, via slide rules, that can in fact be achieved geometrically via a degeneration of intersections with hyperplanes in the projective embedding. These combinatorial rules further generalize to give a positive expansion of any product of psi or omega classes on M_{0,n}-bar in terms of boundary strata.

This is joint work with Sean Griffin and Jake Levinson.

algebraic geometrynumber theory

Audience: researchers in the topic

SFU NT-AG seminar

Series comments: Description: Research/departmental seminar

Seminar usually meets in-person. For online editions, the Zoom link is shared via mailing list.