No label defined (Q4359499)

In the first part of his thesis, the author develops an algorithm for computing all subfields of a given number field. Continuing work in [\textit{J. Klüners} and \textit{M. E. Pohst}, J. Symb. Comput. 24, 385-397 (1997; Zbl 0886.11072)], he achieves this without the knowledge of the Galois group of the field. He illustrates the strength of his algorithm by giving some examples in degree 24 and 60 extensions of \(\mathbb Q\). As an application he introduces a new type of polynomial decomposition (the existence being equivalent to the existence of subfields) and demonstrates how to utilize this to solve polynomial equations. In the second part he extends his work in [\textit{J. Klüners} and \textit{V. Acciaro}, Computing automorphisms of abelian number fields, Math. Comput. (to appear)] to compute automorphisms of (relative) abelian and absolute normal fields. Although it is possible to compute them using factoring algorithms, his approach is much more efficient. The main tool used here is that of approximation in unramified \(p\)-adic extensions of \(\mathbb Q\). The problems are solved in three steps: first to solve some combinatorial problem over finite fields (to get a set of candidates), second to lift those candidates to approximations in a \(p\)-adic extension, and finally to verify the solutions. In order to make this efficient, the author introduces some interesting strategies to work in towers of fields of small degree instead of using large degree fields. All these algorithms are part of the KANT-package [\textit{M. Daberkow} et al., J. Symb. Comput. 24, 267-283 (1997; Zbl 0886.11070)] which is available from ftp://ftp.math.TU-Berlin.DE/pub/algebra/Kant/Kash/.