arXivDaily arXiv每日学术速递 周一至周五更新
今晚才能更新了~~大家休息下再来吧
arXiv 0807.4065math.NT
收藏

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 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑