Local to global algorithms for the Gorenstein adjoint ideal of a curve

DOI10.1007/978-3-319-70566-8_3zbMATH Open1402.14076arXiv1505.05040OpenAlexW2242586162MaRDI QIDQ4556565FDOQ4556565

Authors: Janko Böhm, W. Decker, Santiago Laplagne, Gerhard Pfister 

Publication date: 16 November 2018

Published in: Algorithmic and Experimental Methods in Algebra, Geometry, and Number Theory (Search for Journal in Brave)

Abstract: We present new algorithms for computing adjoint ideals of curves and thus, in the planar case, adjoint curves. With regard to terminology, we follow Gorenstein who states the adjoint condition in terms of conductors. Our main algorithm yields the Gorenstein adjoint ideal G of a given curve as the intersection of what we call local Gorenstein adjoint ideals. Since the respective local computations do not depend on each other, our approach is inherently parallel. Over the rationals, further parallelization is achieved by a modular version of the algorithm which first computes a number of the characteristic p counterparts of G and then lifts these to characteristic zero. As a key ingredient, we establish an efficient criterion to verify the correctness of the lift. Well-known applications are the computation of Riemann-Roch spaces, the construction of points in moduli spaces, and the parametrization of rational curves. We have implemented different variants of our algorithms together with Mnuk's approach in the computer algebra system Singular and give timings to compare the performance of the algorithms.

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

Recommendations

• An algorithm to compute the adjoint ideal of an affine plane algebraic curve
• An algebraic approach to computing adjoint curves
• scientific article; zbMATH DE number 5121566
• Computing integral bases via localization and Hensel lifting
• Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve

zbMATH Keywords

singularitiesalgebraic curvesadjoint ideals

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Singularities of curves, local rings (14H20) Plane and space curves (14H50) Parallel algorithms in computer science (68W10) Computational aspects of algebraic curves (14Q05) Software, source code, etc. for problems pertaining to algebraic geometry (14-04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integral closure of ideals, rings, and modules
• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to Singularities and Deformations
• Singular Points of Complex Hypersurfaces. (AM-61)
• Modular algorithms for computing Gröbner bases.
• On the arithmetic genera and the effective genera of algebraic curves
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Milnor number and deformations of complex curve singularities
• Parametrization of algebraic curves over optimal field extensions
• Rational algebraic curves. A computer algebra approach
• 1-dimensional Cohen-Macaulay rings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm for computing an integral basis in an algebraic function field
• Parallelization of modular algorithms
• An Arithmetic Theory of Adjoint Plane Curves
• Title not available (Why is that?)
• An algebraic approach to computing adjoint curves
• An algorithm to compute the adjoint ideal of an affine plane algebraic curve
• The use of bad primes in rational reconstruction
• Title not available (Why is that?)
• An algorithm for computing the integral closure
• A numerical criterion for simultaneous normalization
• Parallel algorithms for normalization
• Title not available (Why is that?)
• Normalization of rings
• Deficiency of linear series on the normalization of a space curve
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the theory of adjoints. II
• Algorithme de Brill-Noether et codes de Goppa
• LOCAL ANALYSIS OF GRAUERT–REMMERT-TYPE NORMALIZATION ALGORITHMS
• Die verschiedenen Definitionen des adjungierten Ideals einer ebenen algebraischen Kurve

Cited In (9)

• Bad Primes in Computational Algebraic Geometry
• Computing integral bases via localization and Hensel lifting
• Towards massively parallel computations in algebraic geometry
• An Algorithm for Computing the Truncated Annihilating Ideals for an Algebraic Local Cohomology Class
• Modular computations of standard bases for subalgebras
• Extending the GVW Algorithm to Local Ring
• An algorithm to compute the adjoint ideal of an affine plane algebraic curve
• How to reconstruct a planar map from its branching curve
• The use of bad primes in rational reconstruction

Uses Software

• Maple
• SINGULAR
• locnormal.lib
• paraplanecurves.lib
• normal.lib
• adjointideal.lib

This page was built for publication: Local to global algorithms for the Gorenstein adjoint ideal of a curve

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