𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Finding Normal Integral Bases of Cyclic
✍ Vincenzo Acciaro; Claus Fieker πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 237 KB

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

Existence of Integral Bases for Relative
✍ XianKe Zhang; FuHua Xu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 303 KB

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

Explicit Iterative Constructions of Norm
✍ Dirk Hachenberger πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 305 KB

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

On Rings of Numbers Which Are Normal To
✍ G. Wagner πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 485 KB

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:

Rapid grid-based construction of the mol
✍ Walter Rocchia; Sundaram Sridharan; Anthony Nicholls; Emil Alexov; Alessandro Ch πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 210 KB

## 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