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

Simple item page
dc.creatorGuardia, Jordi
dc.creatorMontes, Jesus
dc.creatorNart, Enric
dc.date2008-07-25
dc.date2008-11-03
dc.date.accessioned2026-07-07T10:14:25Z
dc.date.available2026-07-07T10:14:25Z
dc.descriptionWe 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: for a given prime number p, it computes the p-valuation of the discriminant and the factorization of p in a number field of degree 1000 in a few seconds, in a personal computer.
dc.descriptionReferences to [HN] have been updated
dc.identifierhttps://arxiv.org/abs/0807.4065
dc.identifierhttp://arxiv.org/abs/0807.4065
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172875
dc.subjectNumber Theory
dc.subject11Y40; 11R04; 11R29
dc.titleHigher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
dc.typetext

Files

Collections

arXiv