An efficient algorithm for the computation of Galois automorphisms

DOI10.1090/S0025-5718-03-01476-5zbMath1094.11045MaRDI QIDQ4433137

Bill Allombert

Publication date: 29 October 2003

Published in: Mathematics of Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Galois theory (11R32) Separable extensions, Galois theory (12F10) Algebraic number theory computations (11Y40)

Related Items (8)

Galois structure in weakly ramified extensions of \(\mathbb Q\) ⋮ Deciding the nilpotency of the Galois group by computing elements in the centre ⋮ A relative van Hoeij algorithm over number fields ⋮ Explicit determination of generalized symmetric and alternating Galois groups ⋮ Computational Number Theory, Past, Present, and Future ⋮ On the square root of the inverse different ⋮ Sharply \(k\)-transitive permutation groups viewed as Galois groups ⋮ Topics in computational algebraic number theory

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On computing subfields. A detailed description of the algorithm
• The Magma algebra system. I: The user language
• KANT V4
• Factorization in Z[x]
• Computing automorphisms of abelian number fields
• Explicit Galois realization of transitive groups of degree up to 15

This page was built for publication: An efficient algorithm for the computation of Galois automorphisms