Computing with Subfields
โ Scribed by M DABERKOW
- Book ID
- 102604472
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 483 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
โฆ Synopsis
The algorithms presented here make use of subfield information to improve computations. For the three problems we deal with in this paper, the solution of relative norm equations, computation of independent units in the Galois closure of quartic fields and the computation of relative integral bases in quadratic extensions of number fields, we will outline the necessary algorithms that use subfield information and whenever possible we will compare the running time of each algorithm with the equivalent method not using subfield information.
๐ SIMILAR VOLUMES
The conductor-discriminant formula, namely, the Hasse Theorem, states that if a number field K is fixed by a subgroup H of GalรฐQรฐz n ร=Qร; the discriminant of K can be obtained from H by computing the product of the conductors of all characters defined modulo n which are associated to K: By calculat