Efficient computation of the branching structure of an algebraic curve

DOI10.1007/BF03321874zbMATH Open1238.14045arXiv1108.2038MaRDI QIDQ766029FDOQ766029

Authors: J. Frauendiener, C. Klein, Vasilisa Shramchenko 

Publication date: 22 March 2012

Published in: Computational Methods and Function Theory (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1108.2038

Recommendations

• scientific article
• Efficient topology determination of implicitly defined algebraic plane curves.
• Tracing a planar algebraic curve
• A polynomial-time algorithm for the topological type of real algebraic curve
• Braid monodromy computation of real singular curves

zbMATH Keywords

Riemann surfacesmonodromyalgebraic curvesfoundamental group

Mathematics Subject Classification ID

Riemann surfaces; Weierstrass points; gap sequences (14H55) Computational aspects of algebraic curves (14Q05)

Cites Work

• Title not available (Why is that?)
• Spectral Methods in MATLAB
• The small dispersion limit of the Korteweg-de Vries equation. I
• Title not available (Why is that?)
• Introduction to compact Riemann surfaces
• Hyperelliptic theta-functions and spectral methods: KdV and KP solutions
• Computing multiple roots of inexact polynomials
• Ernst equation and Riemann surfaces. Analytical and numerical methods
• Numerical solution of the small dispersion limit of Korteweg—de Vries and Whitham equations
• Computing Riemann matrices of algebraic curves
• Hyperelliptic theta-functions and spectral methods
• Combinatorial group theory, Riemann surfaces and differential equations
• Periodic multiphase solutions of the Kadomtsev-Petviashvili equation
• Computing with Plane Algebraic Curves and Riemann Surfaces: The Algorithms of the Maple Package “Algcurves”
• Algebraic curves and Riemann surfaces in Matlab
• Computing Poincaré theta series for Schottky groups
• Extremal properties of the determinant of the Laplacian in the Bergman metric on the moduli space of genus two Riemann surfaces

Cited In (7)

• Computation of the Artin-Greenberg function of a planar branch
• Computational approach to compact Riemann surfaces
• Tools for the computation of families of coverings
• Analytic continuation and Riemann surface determination of algebraic functions by computer
• Plotting algebraic space curves by cluster computing
• Efficient and exact manipulation of algebraic points and curves
• Title not available (Why is that?)

Uses Software

• Matlab
• MultRoot

This page was built for publication: Efficient computation of the branching structure of an algebraic curve

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766029)