An effective recursion formula for computing intersection numbers
Kefeng Liu, Hao Xu

TL;DR
This paper introduces a new recursion formula that simplifies the computation of intersection numbers on the moduli space of curves, relying solely on genus induction.
Contribution
It presents a novel recursion formula for intersection indices that depends only on genus, streamlining calculations on the moduli space of curves.
Findings
Provides an effective recursive method for intersection number computation
Simplifies calculations by depending only on genus
Enhances understanding of moduli space intersection theory
Abstract
We prove a new effective recursion formula for computing all intersection indices (integrals of classes) on the moduli space of curves, inducting only on the genus.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Polynomial and algebraic computation · Commutative Algebra and Its Applications
