The $S_n$-equivariant Euler characteristic of $\overline{\mathcal{M}}_{1, n}(\mathbb{P}^r, d)$

This paper computes the $S_n$-equivariant topological Euler characteristic of the Kontsevich moduli space $\overline{\mathcal{M}}_{1, n}(\mathbb{P}^r, d)$ by deriving a closed formula for the non-rational-tail subspace via torus localization and expressing the full result through plethysm with a genus-zero contribution.

The Gist

Imagine you are an architect trying to count the number of rooms in a massive, shifting, and sometimes broken-down castle. This isn't just any castle; it's a "Moduli Space," a mathematical structure that represents every possible way to draw a specific type of curve (a loop with a few dots on it) and map it onto a higher-dimensional shape (like a sphere or a cube).

The paper by Siddarth Kannan and Terry Dekun Song is about solving a very specific counting puzzle for this castle when the curves have one hole (like a donut) instead of being a simple loop.

Here is the breakdown of their journey, using simple analogies:

1. The Problem: A Messy Castle

In the world of math, counting things is usually easy if they are smooth and perfect.

• The "Easy" Castle (Genus 0): If your curve is a simple loop (like a circle), the castle is a nice, smooth building. Mathematicians have already figured out how to count the rooms here.
• The "Messy" Castle (Genus 1): When your curve has a hole (a donut), the castle becomes a nightmare. It's not just one building; it's a pile of different buildings glued together, some are broken, some are missing walls, and some are stuck on top of others. It's "reducible" and "singular." Counting the rooms here is incredibly hard because the structure is so chaotic.

2. The Strategy: The "No-Tails" Rule

The authors realized that the messiest parts of the castle are the "rational tails."

• The Analogy: Imagine a donut with a long, thin string of beads hanging off it. In math, these are "rational tails." They are easy to understand on their own, but they make the whole structure complicated to analyze.
• The Move: The authors decided to first ignore the strings and focus only on the "core" of the donut—the part without any tails. They called this the $M^{nrt}$ space (No Rational Tails).
• The Magic Formula: They proved that if you know how to count the "core" donuts, you can mathematically "glue" the tails back on using a special operation called Plethysm. Think of Plethysm as a magical recipe: If you have the core, and you know the recipe for the tails, you can bake the whole cake.

3. The Tool: The "Torus Flashlight"

To count the rooms in the messy core castle, they used a technique called Torus Localization.

• The Analogy: Imagine the castle is in a dark room. You shine a giant, rotating spotlight (the "Torus" or $C^*$ action) on it.
• The Trick: Most of the castle moves around in the light and blurs out. But some specific spots are "fixed points"—they stay perfectly still under the light.
• The Insight: The authors realized that if you count the rooms in these tiny, stationary spots, you can mathematically reconstruct the total count for the entire moving castle. It's like counting the shadows of a spinning fan to figure out how many blades it has.

4. The Pattern: Coloring Beads on a Necklace

When they looked at the stationary spots in the "No-Tails" core, they found a beautiful pattern.

• The Analogy: The fixed points looked like necklaces made of beads.
  • The beads are the "rational curves" (simple loops).
  • The necklace is a cycle (a loop of loops).
  • The "colors" on the beads represent where the curve is pointing in the higher-dimensional space.
• The Math: Counting these necklaces is a classic problem in combinatorics (the math of counting). The authors had to count how many unique necklaces could be made, considering that you can rotate the necklace or flip it over (symmetry).
• The Twist: They had to use a special type of math called Type-B Symmetric Functions. If regular symmetric functions are like counting beads on a string, Type-B functions are like counting beads on a necklace where you can also flip the whole thing inside out.

5. The Result: The Master Formula

By combining the "No-Tails" core, the "Tails" recipe, and the "Necklace" counting, they derived a closed formula.

• What it does: This formula allows you to plug in the size of the space ($r$), the number of dots on the curve ($n$), and the complexity of the map ($d$), and it spits out the exact "Euler Characteristic."
• What is the Euler Characteristic? Think of it as a "fingerprint" or a "summary number" for the shape. It tells you about the number of holes, the number of rooms, and the overall shape of the object in a single number (or a set of numbers that change based on how you permute the dots).

Summary

The paper is a tour de force that takes a chaotic, broken-down mathematical object (the moduli space of donut-shaped curves) and:

1. Isolates the core (removing the messy tails).
2. Uses a spotlight to find the stationary points.
3. Counts the patterns of those points using necklace math.
4. Reassembles the whole using a magical algebraic recipe (Plethysm).

The result is a precise, elegant formula that mathematicians can now use to understand the geometry of these complex shapes, turning a "messy pile of broken buildings" into a solvable puzzle.

Technical Summary

1. Problem Statement

The paper addresses the computation of the $S_n$-equivariant topological Euler characteristic of the Kontsevich moduli space of stable maps, denoted $M_{1,n}(\mathbb{P}^r, d)$. This space parametrizes degree $d$ stable maps from $n$-pointed curves of genus 1 to the projective space $\mathbb{P}^r$.

Key Challenges:

• Singularities and Reducibility: Unlike the genus 0 case ($g=0$), where the moduli space is smooth and irreducible, the genus 1 space is typically reducible, non-equidimensional, and highly singular.
• Equivariance: The authors aim to compute not just the ordinary Euler characteristic, but the Frobenius characteristic $\chi_{S_n}$, which encodes the representation of the symmetric group $S_n$ (acting on the marked points) on the cohomology of the space.
• Motivic Refinement: The goal is to express these invariants in terms of symmetric functions, allowing for a "motivic" understanding that captures the Hodge structure of the space.

2. Methodology

The authors employ a synthesis of algebraic geometry (torus localization, moduli space stratification) and algebraic combinatorics (symmetric functions, wreath products, graph enumeration).

A. Decomposition via Rational Tails

The first major step is separating the moduli space based on the geometry of the domain curve.

• They define $M^{nrt}_{1,n}(\mathbb{P}^r, d)$ as the subspace of maps where the domain curve contains no rational tails (i.e., no rational components attached to the main genus-1 component).
• Proposition 3.9: They establish a structural formula relating the full space to the "no-rational-tails" subspace using plethysm (composition of symmetric functions):
  $$b_{1,r} = b^{nrt}_{1,r} \circ \left( p_1 + \frac{b'_{0,r}}{r+1} \right)$$
  Here, $b_{g,r}$ is the generating function for the equivariant Euler characteristics. The term involving $b'_{0,r}$ accounts for attaching rational tails (trees of $\mathbb{P}^1$s) to the core. This reduces the problem to computing the characteristic of the "core" space $M^{nrt}_{1,n}(\mathbb{P}^r, d)$.

B. Torus Localization

To compute the characteristic of the core space, they utilize torus localization (Graber–Pandharipande).

• They fix a generic $\mathbb{C}^*$-action on $\mathbb{P}^r$ with $r+1$ fixed points.
• By Lemma 3.2, the $S_n$-equivariant characteristic of the space equals that of its $\mathbb{C}^*$-fixed locus.
• The fixed locus $M^{nrt}_{1,n}(\mathbb{P}^r, d)^{\mathbb{C}^*}$ is stratified by localization graphs. For genus 1 without rational tails, these graphs are cycles of length $k \ge 2$.

C. Combinatorial Framework: Type-B Symmetric Functions

The automorphism groups of these cycle graphs are not just symmetric groups but involve the hyperoctahedral group $B_k = S_2 \wr S_k$.

• Type-B Symmetric Functions: The authors utilize the ring of type-B symmetric functions $\Lambda(S_2)$ (studied by Macdonald) to handle the wreath product structure.
• Graph Enumeration: The problem is translated into counting isomorphism classes of decorated cycles (localization graphs) weighted by their automorphism groups.
• Caterpillars: The moduli space of rational curves attached to the cycle vertices is identified with a space of "caterpillars" (chains of rational curves), denoted $Cat$. The Serre characteristic of $Cat$ was previously computed by Bergström and Minabe.

D. The Core Calculation

The calculation proceeds in two main stages:

1. Counting Decorated Cycles ($Dihr$): They enumerate the $\mathbb{C}^*$-fixed strata corresponding to cycles. This involves:
   • Analyzing the subgroup lattice of the dihedral group $D_k \subset B_k$.
   • Using Möbius inversion on the subgroup lattice to count graphs with specific stabilizers.
   • Applying chromatic polynomials to count valid colorings of the quotient graphs.
   • Deriving explicit polynomials $\eta_{k,d}(r)$ and $\theta_{j,k,d}(r)$ that encode these counts.
2. Plethysm: They compute the composition (plethysm) of the cycle characteristic with the caterpillar characteristic ($e(Dihr) \circ_{S_2} e(Cat)$) to obtain the characteristic of the fixed locus.

3. Key Contributions and Results

Main Theorem (Theorem A)

The paper provides a closed formula for the generating function $b_{1,r}$ of the $S_n$-equivariant Euler characteristics of $M_{1,n}(\mathbb{P}^r, d)$.
$$b_{1,r} = b^{nrt}_{1,r} \circ \left( p_1 + \frac{b'_{0,r}}{r+1} \right)$$
where $b^{nrt}_{1,r}$ is explicitly given in terms of:

• Known genus 0 and genus 1 invariants ($a_0, a_1, b'_{0,r}$) derived from Getzler's work.
• New combinatorial terms involving the derivatives of the genus 0 series ($a''_0, \dot{a}_0$).
• Explicit polynomials $\eta_{k,d}(r)$ and $\theta_{j,k,d}(r)$ involving Euler's totient function $\phi$, the Möbius function $\mu$, and binomial coefficients.

Theorem B (Serre Characteristic)

The authors derive the $S_n$-equivariant Serre characteristic (a refinement in the Grothendieck ring of mixed Hodge structures) for the $\mathbb{C}^*$-fixed locus of the no-rational-tails space. This result is stronger than the topological Euler characteristic as it captures Hodge-theoretic data.

Polynomiality

A significant corollary is that for fixed $n, d$, the multiplicity of any irreducible character of $S_n$ in $\chi_{S_n}(M_{1,n}(\mathbb{P}^r, d))$ is a polynomial in $r$ of degree at most $d+1$. This generalizes previous results known for genus 0.

4. Significance and Impact

• First Genus 1 Formula: This is the first comprehensive formula for the equivariant Euler characteristic of Kontsevich moduli spaces in positive genus ($g=1$) for arbitrary $n$ and $d$. Previous work was largely limited to genus 0 or specific cohomology classes.
• Bridging Geometry and Combinatorics: The paper successfully translates complex geometric singularities of moduli spaces into tractable combinatorial problems involving graph colorings and wreath products.
• Motivic Insight: By working with Serre characteristics and mixed Hodge structures, the results provide a deeper understanding of the cohomological structure of these moduli spaces, going beyond simple Euler numbers.
• Future Directions: The methodology sets a precedent for higher genus calculations ($g > 1$) and suggests potential applications to virtual Euler characteristics and K-theoretic Gromov–Witten invariants. The authors also note the potential for comparing these results with other compactifications (e.g., quasimaps).

5. Summary of Technical Tools Used

• Symmetric Functions: Power sums ($p_n$), Schur functions ($s_\lambda$), and plethysm ($\circ$).
• Wreath Products: Type-B symmetric functions and the hyperoctahedral group $B_k$.
• Torus Localization: Reducing the problem to fixed-point loci stratified by graphs.
• Graph Enumeration: Möbius inversion on subgroup lattices of dihedral groups and chromatic polynomials.
• Moduli Theory: Stratification of $M_{1,n}$ by dual graphs and the separation of rational tails.

In conclusion, Kannan and Song provide a rigorous, closed-form solution to a long-standing problem in enumerative geometry, leveraging advanced combinatorial techniques to tame the singularities of genus 1 moduli spaces.