Finding fundamental units in cubic fields
1982 ◽
Vol 92
(3)
◽
pp. 385-389
◽
This paper improves a method of Godwin (4) for finding a pair of fundamental units in a totally real cubic field. The determination of such a unit pair is a well known computational problem. There is an old algorithm (circa 1896) of Voronoi which solves this problem, but the algorithm is quite complicated (an account of it is given in the book of Delone and Faddeev ((3), chapter IV, part A)). The method of Godwin is, in principle, much simpler. However, this method also has its drawbacks (more is said about this in Section 4 below). Indeed, when Godwin's student Angell produced his large table (see (1)) of totally real cubic fields some 15 years after (4) appeared, Voronoi's algorithm was used to compute the pairs of fundamental units.
1960 ◽
Vol 56
(4)
◽
pp. 318-321
◽
Keyword(s):
1984 ◽
Vol 95
(1)
◽
pp. 1-2
◽
1961 ◽
Vol 57
(4)
◽
pp. 728-730
◽
Keyword(s):
1984 ◽
Vol 96
(2)
◽
pp. 191-194
◽
2012 ◽
Vol 132
(8)
◽
pp. 1653-1663
◽
2020 ◽
Vol 16
(06)
◽
pp. 1307-1323
Keyword(s):
1970 ◽
Vol 46
◽
pp. 1135-1140
◽
1978 ◽
Vol 20
(83)
◽
pp. 329-341
◽