TL;DR
This paper bridges algebraic geometry and number theory by proving that functions counting convex planar polygons—which arise in the study of mirror symmetry for elliptic curves—possess deep "mock modular" properties. By analyzing the signed areas of these polygons as indefinite quadratic forms, the authors provide a systematic framework to regularize these counting functions into well-behaved mathematical objects with predictable symmetries.
What Problem Does This Paper Address?
In the study of homological mirror symmetry, researchers often encounter generating functions that count geometric objects. For elliptic curves, these functions count planar polygons with a fixed number of sides ($N$) and fixed angles.
Mathematically, these counting functions take the form of theta functions. If the area of the polygons was always positive (a "positive definite" quadratic form), these functions would be standard modular forms—highly symmetric functions that are cornerstones of number theory. However, the "signed area" of these polygons corresponds to an indefinite quadratic form, meaning the area can be positive, negative, or zero.
This leads to two major hurdles:
- Divergence: Summing over an indefinite form often leads to infinite values (exploding terms).
- Broken Symmetry: Restricting the sum to a specific "cone" (to ensure convergence) usually destroys the modular symmetry that physicists expect these functions to have.
While previous research solved this for specific cases (polygons with $N \le 6$ sides), this paper seeks a systematic extension to a much larger class of convex planar polygons.
Methods
The authors employ several sophisticated techniques from the theory of mock modular forms:
- Signature Analysis: They prove that the quadratic form $Q$ representing the signed area of an $N$-gon has a specific signature: $(1, N-3)$. This signature is the "DNA" of the function and dictates its modular behavior.
- Zwegers' Completion: To restore the broken modular symmetry, the authors add a "completion" term—a real-analytic function involving generalized error functions. This technique, pioneered by Sander Zwegers to explain Ramanujan’s "mock theta functions," allows the authors to create a "completed" function that transforms like a standard modular form.
- Slicing the Cone: To handle convergence issues near "isotropic vectors" (where the polygon's area is zero, essentially squashing it into a line), the authors developed a "slicing" method. This involves breaking the summation range into manageable pieces to prove the function is meromorphic (well-behaved except at isolated points).
- Rationality Conditions: The authors impose specific "rationality conditions" on the angles and side lengths, which ensures that the underlying lattice structure plays nicely with the modular transformations.
Datasets
Not discussed in the paper. As a theoretical mathematics paper, it relies on formal proofs and symbolic examples rather than empirical datasets.
Key Insights and Ideas
- Geometry as Algebra: The paper reinforces the idea that geometric properties (side lengths, perimeters, and areas) can be mapped directly onto algebraic structures (lattice points, bilinear forms, and quadratic forms).
- The "Aha" of Signature $(1, N-3)$: Identifying the exact signature of the area form for any $N$-gon allows the researchers to categorize these functions within the hierarchy of "higher depth" mock modular forms.
- Handling Degeneracy: The most difficult part of the proof involves "degenerate" polygons. The authors show that these correspond to the boundaries of their summation cones and can be handled using limits of the generalized error functions.
- Restoring Symmetry: The "mock" nature of these functions means they aren't symmetric on their own, but they have a "shadow." By adding this shadow (the completion), the full symmetry of the modular group is recovered.
Key Results
- Theorem 1.2 (The Main Result): The authors prove that for convex planar polygons satisfying their rationality conditions, the regularized counting function is a linear combination of mock modular forms of weight at most $N/2 - 1$ and depth at most $N-3$.
- Convergence and Meromorphicity: They rigorously proved that these series converge compactly and are meromorphic, meaning they can be used reliably in further physical or mathematical calculations.
- Example 1.3: The paper provides a concrete application for isosceles trapezoids, explicitly showing how the counting function and its modular completion are constructed using error functions.
Limitations and Future Work
- Convexity Constraint: The current work focuses primarily on convex polygons. Non-convex (concave) or complex (self-intersecting) polygons present a much harder challenge because their area forms can behave more wildly, potentially leading to worse divergence.
- Rationality Dependency: The results rely on specific rationality conditions. Exploring what happens when these conditions are relaxed (the "irrational" case) remains an open question.
- Future Directions: The authors explicitly mention that they intend to investigate the non-convex case in future studies, as the current framework provides the necessary tools to begin tackling those more "chaotic" geometric objects.
Summary updated