Computational aspects of Kummer theory (Q4375619)

The paper gives an excellent survey about the present state of algebraic number theory computations. The basic algorithms being already implemented in computer algebra systems like KANT, MAGMA, PARI, the present work is oriented to computations in relative extensions of number fields. In the paper mainly the so called Kummer extensions are studied. These extensions have a rich theory in the literature. Moreover, recent investigations of the KANT group, M. Daberkow and M. Pohst, J. Klüners and M. Pohst, have considerably contributed to the development of this theory and established the background of powerful algorithms. The following tasks are considered: computation of relative integral bases, relative normal forms, computation of Hilbert class fields, subfield detection and embedding of subfields. For these problems algorithms are given and their theoretical background is also described. The paper is illustrated with interesting examples. These algorithms are implemented in the computer algebra system KANT and have important applications in many fields of algebraic number theory. For the entire collection see [Zbl 0852.00023].