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.

生成讲解博客的中文版本

生成AI智能校验的中文版本