An efficient algorithm for the computation of Galois automorphisms

Authors:
Bill Allombert
Affiliations:
Université Bordeaux I, Laboratoire A2X, 351 Cours De La Libération, 33 405 Talence, France
Venue:
Mathematics of Computation
Year:
2004

Citing 6
Cited 0

A course in computational algebraic number theory

A course in computational algebraic number theory
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
KANT V4

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Computing automorphisms of abelian number fields

Mathematics of Computation
Factorization in Z[x]: the searching phase

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Explicit Galois realization of transitive groups of degree up to 15

Journal of Symbolic Computation - Algorithmic methods in Galois Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an algorithm for computing the Galois automorphisms of a Galois extension which generalizes the algorithm of Acciaro and Klüners to the non-Abelian case. This is much faster in practice than algorithms based on LLL or factorization.