类Feynman图的计数：拟模性和Siegel-Veech权
Counting Feynman-like graphs: Quasimodularity and Siegel-Veech weight
摘要：
我们证明了生成函数的拟模计数环面覆盖，有和没有Siegel-Veech重量。我们的证明是基于分析分解成水平圆柱体的平面。拟模性是由拟椭圆函数的围道积分引起的。它提供了Bloch-Okounkov、Eskin-Okounkov和Chen-Moeller-Zagier的拟模性结果的另一种证明，并推广了Boehm-Bringmann-Buchholz-Markwig关于简单分歧覆盖的结果。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
