Generating stable modular graphs
Abstract
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+n2>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, npointed curves can be stratified by taking loci of curves of a fixed topological type.
 Publication:

arXiv eprints
 Pub Date:
 December 2010
 arXiv:
 arXiv:1012.4777
 Bibcode:
 2010arXiv1012.4777M
 Keywords:

 Mathematics  Algebraic Geometry;
 Mathematics  Combinatorics
 EPrint:
 13 pages, 3 figures. Final version