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

Jordi Guàrdia; Jesús Montes; Enric Nart

doi:10.5802/jtnb.782

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

Jordi Guàrdia, Jesús Montes, Enric Nart

Department of Mathematics

Research output: Contribution to journal › Article › Research › peer-review

33 Citations (Scopus)

Abstract

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 and memory requirements of the algorithm appear to be very good.

Original language	English
Pages (from-to)	667-696
Journal	Journal de Theorie des Nombres de Bordeaux
Volume	23
Issue number	3
DOIs	https://doi.org/10.5802/jtnb.782
Publication status	Published - 1 Jan 2011

Access to Document

10.5802/jtnb.782

Cite this

@article{001529e8bfda4d4f9b7382ae936ba651,

title = "Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields",

abstract = "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 and memory requirements of the algorithm appear to be very good.",

author = "Jordi Gu{\`a}rdia and Jes{\'u}s Montes and Enric Nart",

year = "2011",

month = jan,

day = "1",

doi = "10.5802/jtnb.782",

language = "English",

volume = "23",

pages = "667--696",

journal = "Journal de Theorie des Nombres de Bordeaux",

issn = "1246-7405",

publisher = "Universit{\'e} de Bordeaux",

number = "3",

}

TY - JOUR

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

AU - Guàrdia, Jordi

AU - Montes, Jesús

AU - Nart, Enric

PY - 2011/1/1

Y1 - 2011/1/1

N2 - 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 and memory requirements of the algorithm appear to be very good.

AB - 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 and memory requirements of the algorithm appear to be very good.

UR - https://www.scopus.com/pages/publications/83455220373

U2 - 10.5802/jtnb.782

DO - 10.5802/jtnb.782

M3 - Article

SN - 1246-7405

VL - 23

SP - 667

EP - 696

JO - Journal de Theorie des Nombres de Bordeaux

JF - Journal de Theorie des Nombres de Bordeaux

IS - 3

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this