Algorithms in algebraic number theory
Hendrik W. Lenstra
Abstract
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.
Create a lesson
Related papers
An Infinite Family of Apéry-like Recurrences for Euler's Constant
Rotem Kalisch, Tali Monderer, Elyasheev Leibtag et al.
On the saturability of p-adic Lie groups
Casey Perdue
On Divisor Function Polynomials and Dirichlet Series
Martin N. Huxley, Matthew C. Lettington, Karl Michael Schmidt
On a conjecture on Romanoff type representations
Xiao-Hui Yan
Regularization of a Divergent Arithmetic Product via the Asymptotic Monoid: The Case of (-1)ω(n)
A. Alvarez Cruz, E. A. Alvarez Gutierrez
Appell Sequences in Analytic Number Theory: Shifted Expansions and Dirichlet L-Functions
Abdelmejid Bayad