Algorithms in algebraic number theory
| dc.creator | Lenstra Jr., Hendrik W. | |
| dc.date | 1992-04-01 | |
| dc.date.accessioned | 2026-07-07T09:14:46Z | |
| dc.date.available | 2026-07-07T09:14:46Z | |
| dc.description | 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. | |
| dc.description | 34 pages | |
| dc.identifier | https://arxiv.org/abs/math/9204234 | |
| dc.identifier | http://arxiv.org/abs/math/9204234 | |
| dc.identifier | Bull. Amer. Math. Soc. (N.S.) 26 (1992) 211-244 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/152795 | |
| dc.subject | Number Theory | |
| dc.title | Algorithms in algebraic number theory | |
| dc.type | text |