Efficient computation of the branching structure of an algebraic curve

Details Efficient computation of the branching structure of an algebraic curve Efficient computation of the branching structure of an algebraic curve

2011-08-09

arxiv.org/abs/1108.2038v1

Computer Science

Computational Geometry

18 pages, 7 figures

Scientific paper

An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant points of the curve are constructed via a minimal spanning tree of the discriminant points. This leads to paths of minimal length between the points, which is important for a later stage where these paths are used as integration contours to compute periods of the surface. The branching structure of the surface is obtained by analytically continuing the roots of the equation defining the algebraic curve along the constructed generators of the fundamental group.

Affiliated with

Also associated with

No associations

Rating

Efficient computation of the branching structure of an algebraic curve 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 Efficient computation of the branching structure of an algebraic curve, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient computation of the branching structure of an algebraic curve will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-663457