Let L be a cyclic number field of prime degree p. In this paper we study how to compute efficiently a normal integral basis for L, if there is at least one, assuming that an integral basis Ξ for L is known. We reduce our problem to the problem of finding the generator of a principal ideal in the pth
Algorithms to Construct Normal Bases of Cyclic Number Fields
β Scribed by H.P. Schlickewei; S.A. Stepanov
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 309 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Suppose that L#K are abelian extensions of the rationals Q with Galois groups (ZΓq s Z) n and (ZΓq r Z) m , respectively, q any prime number. It is proved that LΓK has a relative integral basis under certain simple conditions. In particular, [L : K] q s or q s +1 (according to q is odd or even) is e
A characterization of normal bases and complete normal bases in GF(q r n ) over GF(q), where q ΟΎ 1 is any prime power, r is any prime number different from the characteristic of GF(q), and n Υ 1 is any integer, leads to a general construction scheme of series (v n ) nΥ0 in GF(q r Θ ) :Ο Κ nΥ0 GF(q r
For any natural number \(g \geqslant 2\). and for any odd prime \(p\) not dividing \(g\), we give an explicit example of a ring \(R\) of real numbers with the following three properties:
## Abstract This article describes a number of algorithms that are designed to improve both the efficiency and accuracy of finite difference solutions to the PoissonβBoltzmann equation (the FDPB method) and to extend its range of application. The algorithms are incorporated in the DelPhi program. T