2000 character limit reached
Counting Feynman-like graphs: Quasimodularity and Siegel-Veech weight
Published 6 Sep 2016 in math.GT, math.AG, and math.NT | (1609.01658v2)
Abstract: We prove the quasimodularity of generating functions for counting torus covers, with and without Siegel-Veech weight. Our proof is based on analyzing decompositions of flat surfaces into horizontal cylinders. The quasimodularity arise as contour integral of quasi-elliptic functions. It provides an alternative proof of the quasimodularity results of Bloch-Okounkov, Eskin-Okounkov and Chen-Moeller-Zagier, and generalizes the results of Boehm-Bringmann-Buchholz-Markwig for simple ramification covers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
