An efficient algorithm for the computation of Galois automorphisms

DOI10.1090/S0025-5718-03-01476-5MaRDI QIDQ4433137zbMATH OpenFDO

Authors Bill Allombert

Publication date 29 October 2003

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

Full work available at URL https://doi.org/10.1090/S0025-5718-03-01476-5

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3855240
• Computing finite Galois groups arising from automorphic forms
• Computing automorphisms of abelian number fields
• An algorithm for computing invariants of differential Galois groups
• scientific article; zbMATH DE number 1302467
• scientific article; zbMATH DE number 1075588
• scientific article; zbMATH DE number 4125502
• Galois theory of algorithms
• TECHNIQUES FOR COMPUTATIONS OF THE AUTOMORPHISM GROUP OF DOMAIN
• scientific article; zbMATH DE number 3968844

Cites work

• Computing automorphisms of abelian number fields
• Explicit Galois realization of transitive groups of degree up to 15
• Factorization in Z[x]
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 1075588 (Why is no real title available?)
• KANT V4
• On computing subfields. A detailed description of the algorithm
• The Magma algebra system. I: The user language

Cited in

(15)

• On the square root of the inverse different
• Galois structure in weakly ramified extensions of \(\mathbb Q\)
• Subquadratic-time algorithms for normal bases
• A relative van Hoeij algorithm over number fields
• Algorithms for Galois extensions of global function fields. (Abstract of thesis)
• Computing automorphisms of abelian number fields
• scientific article; zbMATH DE number 1305471 (Why is no real title available?)
• Deciding the nilpotency of the Galois group by computing elements in the centre
• Block Systems of a Galois Group
• Computations in Galois cohomology
• Topics in computational algebraic number theory
• Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm
• Computational Number Theory, Past, Present, and Future
• Sharply \(k\)-transitive permutation groups viewed as Galois groups
• Explicit determination of generalized symmetric and alternating Galois groups

Describes a project that uses

Uses Software

• Magma
• PARI/GP
• KANT/KASH

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4433137)