Higher Newton polygons and integral bases

Abstract

Let A be a Dedekind domain, K the fraction field, a non-zero prime ideal of A, and K the completion of K with respect to the -adic topology. At the input of a monic irreducible separable polynomial, f(x)∈ A[x], Montes algorithm determines the factorization of f(x) over K[x], and it provides essential arithmetic information about the finite extensions of K determined by the different irreducible factors. In particular, it can be used to compute -integral bases of the extension of K determined by f(x) newapp. In this paper we present new (and faster) methods to compute -integral bases, based on the use of the quotients of certain divisions with remainder of f(x) that occur along the flow of Montes algorithm.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…