Efficient computation of the branching structure of an algebraic curve

DOI10.1007/BF03321874MaRDI QIDQ766029zbMATH OpenFDO

Authors J. Frauendiener, C. Klein, Vasilisa Shramchenko

Publication date 22 March 2012

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

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

zbMATH Keywords

Riemann surfacesmonodromyalgebraic curvesfoundamental group

Mathematics Subject Classification ID

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

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.

Recommendations

• scientific article; zbMATH DE number 4142180
• 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

Cites work

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

Cited in

(7)

• scientific article; zbMATH DE number 1131788 (Why is no real title available?)
• 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
• Computational approach to compact Riemann surfaces
• Computation of the Artin-Greenberg function of a planar branch

Describes a project that uses

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)