Generating stable modular graphs
2011 (English)In: Journal of symbolic computation, ISSN 0747-7171, E-ISSN 1095-855X, Vol. 46, no 10, 1087-1097 p.Article in journal (Refereed) Published
We present and prove the correctness of the program boundary, whose sources are available at http://people.sissa.it/similar to 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.
Place, publisher, year, edition, pages
2011. Vol. 46, no 10, 1087-1097 p.
Generation algorithm, Stable graph moduli curves
IdentifiersURN: urn:nbn:se:kth:diva-40641DOI: 10.1016/j.jsc.2011.05.008ISI: 000294517000001ScopusID: 2-s2.0-80051469790OAI: oai:DiVA.org:kth-40641DiVA: diva2:443918
QC 201109272011-09-272011-09-202011-09-27Bibliographically approved