On effective computation of fundamental units. II
HTML articles powered by AMS MathViewer
- by Michael Pohst, Peter Weiler and Hans Zassenhaus PDF
- Math. Comp. 38 (1982), 293-329 Request permission
Abstract:
The new method for efficient computation of fundamental units of an algebraic number field originated by two of die authors in part I is used to develop a powerful computer program. Besides the description of this program part II contains a complete list of fundamental units of algebraic number fields of degree $n = 3,4,5,6$ and small absolute discriminant.References
-
D. Ford, On the Computation of the Maximal Order in a Dedekind Domain, Thesis, The Ohio State University, 1978.
M. Pohst, “A program for determining fundamental units,” in SYMSAC 76, pp. 177-182.
- Michael Pohst, On the computation of number fields of small discriminants including the minimum discriminants of sixth degree fields, J. Number Theory 14 (1982), no. 1, 99–117. MR 644904, DOI 10.1016/0022-314X(82)90061-0 M. Pohst, “On the computation of lattice vectors of minimal length, successive minima, and reduced bases with applications,” ACM SIGSAM Bull., v. 15, 1981, pp. 37-44.
- Michael Pohst and Hans Zassenhaus, An effective number geometric method of computing the fundamental units of an algebraic number field, Math. Comp. 31 (1977), no. 139, 754–770. MR 498486, DOI 10.1090/S0025-5718-1977-0498486-5
- Michael Pohst and Hans Zassenhaus, On effective computation of fundamental units. I, Math. Comp. 38 (1982), no. 157, 275–291. MR 637307, DOI 10.1090/S0025-5718-1982-0637307-6
Additional Information
- © Copyright 1982 American Mathematical Society
- Journal: Math. Comp. 38 (1982), 293-329
- MSC: Primary 12A45; Secondary 12-04
- DOI: https://doi.org/10.1090/S0025-5718-1982-0637308-8
- MathSciNet review: 637308