Generating stable modular graphs

Details Generating stable modular graphs Generating stable modular graphs

2010-12-21

arxiv.org/abs/1012.4777v2

Journal of Symbolic Computation 46 (2011), pp. 1087-1097

Mathematics

Algebraic Geometry

13 pages, 3 figures. Final version

Scientific paper

10.1016/j.jsc.2011.05.008

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.

Affiliated with

Also associated with

No associations

Rating

Generating stable modular graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generating stable modular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generating stable modular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96796