We present and prove the correctness of the program boundary, whose sources 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 nunordered 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. © 2011 Elsevier Ltd.
Maggiolo, S., Pagani, N. (2011). Generating stable modular graphs. JOURNAL OF SYMBOLIC COMPUTATION, 46(10), 1087-1097 [10.1016/j.jsc.2011.05.008].
Generating stable modular graphs
Pagani, Nicola
2011
Abstract
We present and prove the correctness of the program boundary, whose sources 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 nunordered 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. © 2011 Elsevier Ltd.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
