Computing integral bases via localization and Hensel lifting

DOI10.1016/J.JSC.2020.07.007zbMATH Open1484.13057arXiv1505.05054OpenAlexW2249727573MaRDI QIDQ820962FDOQ820962

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

Publication date: 29 September 2021

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of the concepts of localization and completion, together with the Chinese remainder theorem, to reduce the problem to the task of finding integral bases for the branches of each singularity of the curve. To solve the latter task, in turn, we work with suitably truncated Puiseux expansions. In contrast to van Hoeij's algorithm, which also relies on Puiseux expansions (but pursues a different strategy), we use Hensel's lemma as a key ingredient. This allows us at some steps of the algorithm to compute factors corresponding to conjugacy classes of Puiseux expansions, without actually computing the individual expansions. In this way, we make substantially less use of the Newton-Puiseux algorithm. In addition, our algorithm is inherently parallel. As a result, it outperforms in most cases any other algorithm known to us by far. Typical applications are the computation of adjoint ideals and, based on this, the computation of Riemann-Roch spaces and the parametrization of rational curves.

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

Recommendations

• scientific article; zbMATH DE number 1273654
• An algorithm for computing an integral basis in an algebraic function field
• Local to global algorithms for the Gorenstein adjoint ideal of a curve
• Computation of integral bases
• Higher Newton polygons and integral bases

zbMATH Keywords

integral basisintegral closurenormalizationPuiseux seriescurve singularity

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Algebraic number theory computations (11Y40) Integral closure of commutative rings and ideals (13B22) Algebraic functions and function fields in algebraic geometry (14H05) Computational aspects of algebraic curves (14Q05) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Cites Work

• The Magma algebra system. I: The user language
• A Singular Introduction to Commutative Algebra
• Title not available (Why is that?)
• Integral closure of ideals, rings, and modules
• Algebraic Function Fields and Codes
• Implementing the Round Four maximal order algorithm
• Modular algorithms for computing Gröbner bases.
• Éléments de géométrie algébrique. IV: Étude locale des schémas et des morphismes de schémas. (Troisième partie). Rédigé avec la colloboration de J. Dieudonné
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fundamental Group for Some Cuspidal Curves
• An algorithm for computing an integral basis in an algebraic function field
• The use of bad primes in rational reconstruction
• An algorithm for computing the integral closure
• Parallel algorithms for normalization
• Title not available (Why is that?)
• Local to global algorithms for the Gorenstein adjoint ideal of a curve
• Normalization of rings

Cited In (11)

• Integral closures and weight functions over finite fields.
• Higher Newton polygons and integral bases
• Computation of integral bases
• On computing a separating transcendence basis
• Local to global algorithms for the Gorenstein adjoint ideal of a curve
• An algorithm for computing an integral basis in an algebraic function field
• Numerical calculation of H-bases for positive dimensional varieties
• Computing H-bases via minimal bases for syzygy modules
• Reduced normal form of local integral bases
• Fast integral bases computation
• An Algorithm for Computing Standard Bases by Change of Ordering via Algebraic Local Cohomology

Uses Software

• Magma
• Maple
• SINGULAR

This page was built for publication: Computing integral bases via localization and Hensel lifting

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