Abstract
In complex algebraic geometry, the problem of enumerating plane elliptic curves of given degree with fixed complex structure has been solved by R. Pandharipande using Gromov–Witten theory. This article treats the tropical analogue: determining the number $E_{\mathrm{trop}}(d)$ of tropical elliptic plane curves of degree $d$ and fixed tropical $j$-invariant interpolating points in general position. We show that this number is independent of the position of the points and the value of the $j$-invariant, coinciding with the number of complex elliptic curves (for $j \notin \{0, 1728\}$). This result simplifies G. Mikhalkin's algorithm for counting curves via lattice paths.
Introduction
In enumerative geometry, a fundamental question is: "How many geometric curves of a certain type pass through a specific set of points?" While well-understood for rational curves (genus 0), elliptic curves (genus 1) introduce the $j$-invariant, which determines their isomorphism class. Following Pandharipande's solution for complex curves, this paper establishes a tropical correspondence theorem, defining a robust tropical $j$-invariant and proving the consistency of tropical counts with classical results.
Methodology
The authors utilize several techniques from tropical and discrete geometry to establish their results:
- Moduli Space as a Weighted Polyhedral Complex: The moduli space of tropical elliptic curves is treated as a "tropical orbifold," employing fractional weights (e.g., $1/2$) to account for internal symmetries (automorphisms).
- Tropical Multiplicities: Curves are counted using multiplicities derived from the determinant of an evaluation map tracking point intersections.
- Wall-Crossing Invariance: The paper proves the count is independent of point configuration and $j$-invariant value by showing total multiplicity remains constant across changes in combinatorial types.
- Degeneration Analysis: To compute $E_{\mathrm{trop}}(d)$, the authors analyze extreme cases of the $j$-invariant:
- Large $j$-invariant: The cycle becomes extremely long, relating the curve to a rational curve with a specific edge structure.
- Small $j$-invariant: The cycle shrinks to a point, allowing the use of Pick’s Theorem to simplify combinatorial summations.
Key Insights and Results
The Tropical $j$-invariant
In the tropical setting, the $j$-invariant is defined as the length of the curve's unique cycle. This paper confirms that this simple metric is sufficient to mirror the complex geometry results. Notably, the tropical count is invariant for all non-negative $j$, unlike the complex case where $j=0$ and $j=1728$ are singular.
Numerical Correspondence
The central result, Theorem 6.3, establishes the relationship: $$E_{\text{trop}}(d) = \binom{d-1}{2} N_{\text{trop}}(d)$$ where $N_{\text{trop}}(d)$ is the number of rational tropical curves. This demonstrates that counting elliptic curves is fundamentally linked to counting rational curves via a specific binomial coefficient.
Algorithm Optimization
By equating results from large and small $j$-invariant limits, the authors derive a modified version of Mikhalkin’s lattice path algorithm. This approach requires fewer lattice paths, significantly increasing the efficiency of combinatorial computations for higher degrees.
Limitations and Future Work
While the paper proves numerical correspondence, it does not provide a direct curve-by-curve bijection between complex and tropical sets. Investigating the failure of such bijections at special $j$-values remains an open question. Additionally, while the concepts are general, the specific lattice path optimizations are currently unique to the projective plane ($\mathbb{P}^2$). Extending these methods to higher genus ($g > 1$) would require a more sophisticated tropical definition of fixed complex structure.
Summary updated