Now showing items 1-3 of 3

  • Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields 

    Guàrdia Rubies, Jordi; Montes Peral, Jesús; Nart, Enric (2011-12-01)
    Article
    Open Access
    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 polygons of higher order. The running-time ...
  • Newton polygons of higher order in algebraic number theory 

    Guàrdia Rubies, Jordi; Montes Peral, Jesús; Nart, Enric (2012-01-10)
    Article
    Open Access
    We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a p-adic eld, together with relevant arithmetic information about the elds generated by ...
  • Single-factor lifting and factorization of polynomials over local fields 

    Guàrdia Rubies, Jordi; Nart, Enric; Pauli, S. (2012-11)
    Article
    Open Access
    Let f (x) be a separable polynomial over a local field. The Montes algorithm computes certain approximations to the different irreducible factors of f (x), with strong arithmetic properties. In this paper, we develop an ...