Let
be an abelian number field of degree
. Most algorithms for computing the lattice of subfields of
require the computation of all the conjugates of
. This is usually achieved by factoring the minimal polynomial
of
over
. In practice, the existing algorithms for factoring polynomials over algebraic number fields can handle only problems of moderate size. In this paper we describe a fast probabilistic algorithm for computing the conjugates of
, which is based on
-adic techniques. Given
and a rational prime
which does not divide the discriminant
of
, the algorithm computes the Frobenius automorphism of
in time polynomial in the size of
and in the size of
. By repeatedly applying the algorithm to randomly chosen primes it is possible to compute all the conjugates of
.
Let
be an abelian number field of prime degree
, and let
be a nonzero rational number. We describe an algorithm which takes as input
and the minimal polynomial of
over
, and determines if
is a norm of an element of
. We show that, if we ignore the time needed to obtain a complete factorization of
and a complete factorization of the discriminant of
, then the algorithm runs in time polynomial in the size of the input. As an application, we give an algorithm to test if a cyclic algebra
over
is a division algebra.
Let p and q be two positive prime integers. In this paper we obtain a complete characterization of division quaternion algebras HK(p, q) over the composite K of n quadratic number fields.
1 September 2000 in Journal of Symbolic Computation