8 citations · 16 across the 3 of their papers we have counts for
3 papers
math.NT2009★ 2 cited
Newton polygons and p-integral bases
Lhoussain El fadil, Jesus Montes, Enric Nart
Let p be a prime number. In this paper we use an old technique of Ore, based on Newton polygons, to construct in an efficient way p-integral bases of number fields defined by a p-r…
math.NT2008★ 6 cited
Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
Jordi Guardia, Jesus Montes, Enric Nart
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton p…
math.NT2008★ 8 cited
Newton polygons of higher order in algebraic number theory
Jordi Guardia, Jesus Montes, Enric Nart
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a -adic field, together with relevant arithmeti…