Computing integral bases via localization and Hensel lifting
From MaRDI portal
Publication:820962
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)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4165039 (Why is no real title available?)
- scientific article; zbMATH DE number 3620034 (Why is no real title available?)
- scientific article; zbMATH DE number 1361357 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1514318 (Why is no real title available?)
- scientific article; zbMATH DE number 3365583 (Why is no real title available?)
- A Singular Introduction to Commutative Algebra
- Algebraic Function Fields and Codes
- An algorithm for computing an integral basis in an algebraic function field
- An algorithm for computing the integral closure
- Fundamental Group for Some Cuspidal Curves
- Implementing the Round Four maximal order algorithm
- Integral closure of ideals, rings, and modules
- Local to global algorithms for the Gorenstein adjoint ideal of a curve
- Modular algorithms for computing Gröbner bases.
- Normalization of rings
- Parallel algorithms for normalization
- The Magma algebra system. I: The user language
- The use of bad primes in rational reconstruction
- É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é
Cited in
(11)- Computation of integral bases
- Integral closures and weight functions over finite fields.
- Numerical calculation of H-bases for positive dimensional varieties
- Local to global algorithms for the Gorenstein adjoint ideal of a curve
- Computing H-bases via minimal bases for syzygy modules
- Higher Newton polygons and integral bases
- An algorithm for computing an integral basis in an algebraic function field
- Reduced normal form of local integral bases
- An Algorithm for Computing Standard Bases by Change of Ordering via Algebraic Local Cohomology
- On computing a separating transcendence basis
- Fast integral bases computation
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)
