On computing isomorphisms of equation orders
Author:
M. Pohst
Journal:
Math. Comp. 48 (1987), 309314
MSC:
Primary 11R09; Secondary 1104, 11Y40
MathSciNet review:
866116
Fulltext PDF Free Access
Abstract 
References 
Similar Articles 
Additional Information
Abstract: A numbergeometric method for computing isomorphisms of algebraic number fields (respectively, orders of such fields) is developed. Its main advantage is its easy implementation and moderate computation time.
 [1]
F. Diaz y Diaz, Private communication to the author.
 [2]
U.
Fincke and M.
Pohst, Improved methods for calculating
vectors of short length in a lattice, including a complexity
analysis, Math. Comp. 44
(1985), no. 170, 463–471. MR 777278
(86e:11050), http://dx.doi.org/10.1090/S00255718198507772788
 [3]
A.
K. Lenstra, H.
W. Lenstra Jr., and L.
Lovász, Factoring polynomials with rational
coefficients, Math. Ann. 261 (1982), no. 4,
515–534. MR
682664 (84a:12002), http://dx.doi.org/10.1007/BF01457454
 [4]
M.
Pohst, The minimum discriminant of seventh degree totally real
algebraic number fields, Number theory and algebra, Academic Press,
New York, 1977, pp. 235–240. MR 0466069
(57 #5952)
 [5]
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
(83g:12009), http://dx.doi.org/10.1016/0022314X(82)900610
 [6]
M. Pohst & H. Zassenhaus, Methods and Problems of Computational Algebraic Number Theory, Cambridge Univ. Press. (To appear.)
 [7]
H.
Zassenhaus and J.
Liang, On a problem of Hasse, Math. Comp. 23 (1969), 515–519. MR 0246853
(40 #122), http://dx.doi.org/10.1090/S00255718196902468532
 [8]
Horst
G. Zimmer, Computational problems, methods, and results in
algebraic number theory, Lecture Notes in Mathematics, Vol. 262,
SpringerVerlag, BerlinNew York, 1972. MR 0323751
(48 #2107)
 [1]
 F. Diaz y Diaz, Private communication to the author.
 [2]
 U. Fincke & M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comp., v. 44, 1985, pp. 463471. MR 777278 (86e:11050)
 [3]
 A. K. Lenstra, H. W. Lenstra, Jr. & L. Lovász, "Factoring polynomials with rational coefficients," Math. Ann., v. 261, 1982, pp. 515534. MR 682664 (84a:12002)
 [4]
 M. Pohst, "The minimum discriminant of seventh degree totally real algebraic number fields," in Number Theory and Algebra (H. Zassenhaus, ed.), Academic Press, New York, 1977, pp. 235240. MR 0466069 (57:5952)
 [5]
 M. Pohst, "On the computation of number fields of small discriminants including the minimum discriminants of sixth degree fields," J. Number Theory, v. 14, 1982, pp. 99117. MR 644904 (83g:12009)
 [6]
 M. Pohst & H. Zassenhaus, Methods and Problems of Computational Algebraic Number Theory, Cambridge Univ. Press. (To appear.)
 [7]
 H. Zassenhaus & J. Liang, "On a problem of Hasse," Math. Comp., v. 23, 1969, pp. 515519. MR 0246853 (40:122)
 [8]
 H. G. Zimmer, Computational Problems, Methods, and Results in Algebraic Number Theory, Lecture Notes in Math., vol. 262, SpringerVerlag, Berlin and New York, 1972. MR 0323751 (48:2107)
Similar Articles
Retrieve articles in Mathematics of Computation
with MSC:
11R09,
1104,
11Y40
Retrieve articles in all journals
with MSC:
11R09,
1104,
11Y40
Additional Information
DOI:
http://dx.doi.org/10.1090/S00255718198708661162
PII:
S 00255718(1987)08661162
Article copyright:
© Copyright 1987
American Mathematical Society
