Volume 20, issue 5 (2020)

Download this article
Download this article For screen
For printing
Recent Issues

Volume 20
Issue 5, 2145–2685
Issue 4, 1601–2143
Issue 3, 1073–1600
Issue 2, 531–1072
Issue 1, 1–529

Volume 19, 7 issues

Volume 18, 7 issues

Volume 17, 6 issues

Volume 16, 6 issues

Volume 15, 6 issues

Volume 14, 6 issues

Volume 13, 6 issues

Volume 12, 4 issues

Volume 11, 5 issues

Volume 10, 4 issues

Volume 9, 4 issues

Volume 8, 4 issues

Volume 7, 4 issues

Volume 6, 5 issues

Volume 5, 4 issues

Volume 4, 2 issues

Volume 3, 2 issues

Volume 2, 2 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editorial Interests
Subscriptions
 
Submission Guidelines
Submission Page
Policies for Authors
Ethics Statement
 
ISSN (electronic): 1472-2739
ISSN (print): 1472-2747
Author Index
To Appear
 
Other MSP Journals
Pillowcase covers: counting Feynman-like graphs associated with quadratic differentials

Elise Goujard and Martin Möller

Algebraic & Geometric Topology 20 (2020) 2451–2510
Abstract

We prove the quasimodularity of generating functions for counting pillowcase covers, with and without Siegel–Veech weight. Similar to prior work on torus covers, the proof is based on analyzing decompositions of half-translation surfaces into horizontal cylinders. It provides an alternative proof of the quasimodularity results of Eskin and Okounkov and a practical method to compute area Siegel–Veech constants.

A main new technical tool is a quasipolynomiality result for 2–orbifold Hurwitz numbers with completed cycles.

Keywords
flat surfaces, covers, Feynman graphs, quasimodular forms
Mathematical Subject Classification 2010
Primary: 11F11, 32G15
Secondary: 14H30, 14N10, 30F30, 81T18
References
Publication
Received: 17 October 2018
Revised: 29 August 2019
Accepted: 7 January 2020
Published: 4 November 2020
Authors
Elise Goujard
Institut de Mathématiques de Bordeaux
Université de Bordeaux
Talence
France
Martin Möller
Institut für Mathematik
Goethe-Universität Frankfurt
Frankfurt am Main
Germany