Computing integral bases via localization and Hensel lifting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Computing integral bases via localization and Hensel lifting


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 (van Hoeij, 1994), 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 (B¨ohm et al., 2017) and, based on this, the computation of Riemann-Roch spaces and the parametrization of rational curves.
Fichier principal
Vignette du fichier
07.pdf (461.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02912148 , version 1 (05-08-2020)


  • HAL Id : hal-02912148 , version 1


Janko Böhm, Wolfram Decker, Santiago Laplagne, Gerhard Pfister. Computing integral bases via localization and Hensel lifting. MEGA 2019 - International Conference on Effective Methods in Algebraic Geometry, Jun 2019, Madrid, Spain. ⟨hal-02912148⟩


91 View
131 Download


Gmail Facebook X LinkedIn More