Change search
ReferencesLink to record
Permanent link

Direct link
Generating stable modular graphs
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
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
Abstract [en]

We present and prove the correctness of the program boundary, whose sources are available at 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.
Keyword [en]
Generation algorithm, Stable graph moduli curves
National Category
URN: urn:nbn:se:kth:diva-40641DOI: 10.1016/j.jsc.2011.05.008ISI: 000294517000001ScopusID: 2-s2.0-80051469790OAI: diva2:443918
QC 20110927Available from: 2011-09-27 Created: 2011-09-20 Last updated: 2011-09-27Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Pagani, Nicola
By organisation
Mathematics (Div.)
In the same journal
Journal of symbolic computation

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 15 hits
ReferencesLink to record
Permanent link

Direct link