Residue polytopes
Omid Amini, Eduardo Esteves, Eduardo Garcez

TL;DR
This paper introduces residue polytopes derived from level graphs, demonstrating their face structure and compatibility, with applications to the limits of Abelian differentials on Riemann surfaces.
Contribution
It defines residue polytopes for level graphs, proves their face relations, and connects these structures to the geometry of Riemann surface degenerations.
Findings
Residue polytopes correspond to level graphs and their face relations.
Residue polytopes form all faces of the polytope associated with the trivial partition.
Applications include describing limits of Abelian differentials on degenerating Riemann surfaces.
Abstract
A level graph is the data of a pair consisting of a finite graph and an ordered partition on the set of vertices of . To each level graph on vertices we associate a polytope in called its residue polytope. We show that residue polytopes are compatible with each other in the sense that if is a coarsening of , then the polytope associated to is a face of the one associated to . Moreover, they form all the faces of the residue polytope of , defined as the polytope associated to the level graph with the trivial ordered partition. The results are used in a companion work to describe limits of spaces of Abelian differentials on families of Riemann surfaces approaching a stable Riemann surface on the boundary of the moduli space.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Polymer Synthesis and Characterization · Complexity and Algorithms in Graphs · semigroups and automata theory
