Generating stable modular graphs

We present the program Boundary, whose source files are available at http://people.sissa.it/~maggiolo/boundary/. Given two natural numbers g and n satisfying 2g+n-2>0, the program generates all genus g stable graphs with n unordered marked points. Each such graph determines the topological type o...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Maggiolo, Stefano, Pagani, Nicola
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 26.08.2011
Subjects
Graphs
Mathematics - Algebraic Geometry
Mathematics - Combinatorics
Number theory
Topology
Online AccessGet full text

Cover

More Information
Summary:We present the program Boundary, whose source files are available at http://people.sissa.it/~maggiolo/boundary/. Given two natural numbers g and n satisfying 2g+n-2>0, the program generates all genus g stable graphs with n unordered marked points. Each such graph determines the topological type of a nodal stable curve of arithmetic genus g with n unordered marked points. Our motivation comes from the fact that the boundary of the moduli space of stable genus g, n-pointed curves can be stratified by taking loci of curves of a fixed topological type.
ISSN:2331-8422
DOI:10.48550/arxiv.1012.4777