Higher Newton polygons and integral bases
Number Theory
2012-07-24 v3
Abstract
Let be a Dedekind domain, the fraction field, a non-zero prime ideal of , and the completion of with respect to the -adic topology. At the input of a monic irreducible separable polynomial, , Montes algorithm determines the factorization of over , and it provides essential arithmetic information about the finite extensions of determined by the different irreducible factors. In particular, it can be used to compute -integral bases of the extension of determined by \cite{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 that occur along the flow of Montes algorithm.
Cite
@article{arxiv.0902.3428,
title = {Higher Newton polygons and integral bases},
author = {J. Guardia and J. Montes and E. Nart},
journal= {arXiv preprint arXiv:0902.3428},
year = {2012}
}