𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algorithm for the Construction of a Normal Basis

✍ Scribed by Kurt Girstmair

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
117 KB
Volume
78
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis

We present an algorithm for the construction of a normal basis of a Galois extension of degree n in characteristic 0. The algorithm requires O(n 4 ) multiplications in the ground field. It is based on representation theory but does not require the knowledge of representation theoretical data (like characters).

πŸ“œ SIMILAR VOLUMES

An Algorithm for Computing a New Normal
An Algorithm for Computing a New Normal Form for Dynamical Systems
✍ Guoting Chen; Jean Della Dora πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 378 KB

We propose in this paper a new normal form for dynamical systems or vector fields which improves the classical normal forms in the sense that it is a further reduction of the classical normal forms. We give an algorithm for an effective computation of these normal forms. Our approach is rational in

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced GrΓΆbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
✍ Ulla Koppenhagen; Ernst W. Mayr πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 404 KB

It is known that the reduced GrΓΆbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by KΓΌhnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper

An Algorithm for Constructing Local Regi
An Algorithm for Constructing Local Regions in a Phylogenetic Network
✍ K.T. Huber; E.E. Watson; M.D. Hendy πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 102 KB

The groupings of taxa in a phylogenetic tree cannot represent all the conflicting signals that usually occur among site patterns in aligned homologous genetic sequences. Hence a tree-building program must compromise by reporting a subset of the patterns, using some discriminatory criterion. Thus, in