Computation of integral bases

DOI10.1016/J.JNT.2016.01.011MaRDI QIDQ271785zbMATHOpenAlexFDO

Authors Jens-Dietrich Bauch

Publication date 20 April 2016

Published in Journal of Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

Dedekind domain\(\mathfrak p\)-integral basismaximal orderMontes algorithm

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Algebraic numbers; rings of algebraic integers (11R04) Dedekind, Prüfer, Krull and Mori rings and their generalizations (13F05)

Abstract: Let $A$ be a Dedekind domain, $K$ the fraction field of $A$, and $finA[x]$ a monic irreducible separable polynomial. For a given non-zero prime ideal $mathfrakp$ of $A$ we present in this paper a new method to compute a $mathfrakp$-integral basis of the extension of $K$ determined by $f$. Our method is based on the use of simple multipliers that can be constructed with the data that occurs along the flow of the Montes Algorithm. Our construction of a $mathfrakp$-integral basis is significantly faster than the similar approach from $[7]$ and provides in many cases a priori a triangular basis.

Recommendations

• scientific article; zbMATH DE number 1985595
• Computation of triangular integral bases
• Computation of relative integral bases for algebraic number fields
• scientific article; zbMATH DE number 1182964
• Publication:3211416
• Computing integral bases via localization and Hensel lifting
• Computation of Gröbner bases
• Calculating power integral bases by using relative power integral bases
• Computation of integral bases in certain \(S_ n\) extensions of \({\mathbb{Q}}\)
• Numerical computation of H-bases

Cites work

• scientific article; zbMATH DE number 5050432 (Why is no real title available?)
• A new computational approach to ideal theory in number fields
• Complexity of OM factorizations of polynomials over local fields
• Construction and estimation of bases in function fields
• Construction of integral basis. I
• Fast multiplication of large numbers
• Genetics of polynomials over local fields
• Higher Newton polygons and integral bases
• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Implementing the Round Four maximal order algorithm
• Newton polygons of higher order in algebraic number theory
• Single-factor lifting and factorization of polynomials over local fields
• The Magma algebra system. I: The user language

Cited in

(12)

• Computing integral bases via localization and Hensel lifting
• Explicit Coleman integration for curves
• Triangular bases of integral closures
• Computation of triangular integral bases
• scientific article; zbMATH DE number 1404127 (Why is no real title available?)
• Higher Newton polygons and integral bases
• Dedekind's criterion and integral bases
• An algorithm for computing an integral basis in an algebraic function field
• scientific article; zbMATH DE number 1985595 (Why is no real title available?)
• Counting points on curves using a map to \(\mathbf P^1\). II.
• Square-free OM computation of global integral bases
• Fast integral bases computation

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Computation of integral bases

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