English

Higher Newton polygons and integral bases

Number Theory 2012-07-24 v3

Abstract

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

Keywords

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}
}
R2 v1 2026-06-21T12:13:31.115Z