arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/9204234math.NT
收藏

代数数论中的算法

Algorithms in algebraic number theory

Hendrik W. Lenstra

摘要:

本文讨论算法代数数论的基本问题。重点是从纯数学的角度来看感兴趣的方面,而实际问题在很大程度上被忽视了。我们描述了已经做了什么,更重要的是,在该地区还需要做什么。我们希望表明,算法的研究不仅增加了我们的理解代数数域,但也激发了我们的好奇心。主要讨论了三个问题:伽罗瓦群的判定,代数数域的整数环的判定,整数环的单位群和类群的计算。

英文摘要:

In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and, more importantly, what remains to be done in the area. We hope to show that the study of algorithms not only increases our understanding of algebraic number fields but also stimulates our curiosity about them. The discussion is concentrated of three topics: the determination of Galois groups, the determination of the ring of integers of an algebraic number field, and the computation of the group of units and the class group of that ring of integers.

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

↑