pith. sign in

arxiv: 0902.3428 · v3 · pith:ZJMNUNZRnew · submitted 2009-02-19 · 🧮 math.NT

Higher Newton polygons and integral bases

classification 🧮 math.NT
keywords basesintegralalgorithmcomputedeterminedirreduciblemontesadic
0
0 comments X
read the original abstract

Let $A$ be a Dedekind domain, $K$ the fraction field, $\p$ a non-zero prime ideal of $A$, and $K_\pp$ the completion of $K$ with respect to the $\p$-adic topology. At the input of a monic irreducible separable polynomial, $f(x)\in A[x]$, Montes algorithm determines the factorization of $f(x)$ over $K_\pp[x]$, and it provides essential arithmetic information about the finite extensions of $K_\pp$ determined by the different irreducible factors. In particular, it can be used to compute $\p$-integral bases of the extension of $K$ determined by $f(x)$ \cite{newapp}. In this paper we present new (and faster) methods to compute $\p$-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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.