Computation of integral bases

. 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

m a t h f r a k p

-integral basis is significantly faster than the similar approach from

[7]

and provides in many cases a priori a triangular basis.

Review text

Let \(\mathfrak p\) be a maximal ideal of a Dedekind domain with field of fractions \(K\), and \(f\) a monic irreducible separable polynomial from \(A[x]\). The author is successful in attaining two goals: at a theoretical level, obtain a new characterisation for a \(\mathfrak p\)-integral basis of the extension of \(K\) determined by \(f\), and, from a practical standpoint, significant speed-up in the construction of such a basis.NEWLINENEWLINEThe key-point for the theoretical study turns out to be an original weakening of the concept of reduceness introduced by \textit{W. H. Schmidt} [J. Number Theory 39, 181--224 (1991; Zbl 0764.11046)]. Combining this with the fact that most of the ingredients can be retrieved from data accumulated by performing the Montes algorithm, one has an explanation for the striking effectiveness of the ensuing technique. The construction described here is notably simpler, hence much faster, than the methods available in the literature. The new technique has the extra benefit of producing in many cases a triangular basis.

Recommendations

Cites work

Cited in

(15)

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)