Computing automorphisms of abelian number fields

DOI10.1090/S0025-5718-99-01084-4zbMath0937.11062MaRDI QIDQ4240588

Jürgen Klüners, Vincenzo Acciaro

Publication date: 28 April 1999

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

zbMATH Keywords

abelian fieldFrobenius automorphismHensel's method

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Software, source code, etc. for problems pertaining to number theory (11-04) Other abelian and metabelian extensions (11R20)

Related Items (12)

Deciding the nilpotency of the Galois group by computing elements in the centre ⋮ Explicit determination of generalized symmetric and alternating Galois groups ⋮ Computing class fields via the Artin map ⋮ Sharply \(k\)-transitive permutation groups viewed as Galois groups ⋮ Galois group computation for rational polynomials ⋮ Explicit Galois realization of transitive groups of degree up to 15 ⋮ An efficient algorithm for the computation of Galois automorphisms ⋮ Algorithms for Function Fields ⋮ COMPUTING NORMAL INTEGRAL BASES OF ABELIAN NUMBER FIELDS ⋮ Finding normal integral bases of cyclic number fields of prime degree ⋮ Computing local Artin maps, and solvability of norm equations ⋮ Computing splitting fields using Galois theory and other Galois constructions

Uses Software

• KANT/KASH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• KANT V4
• On computing subfields
• Efficient rational number reconstruction
• An inequality for the discriminant of a polynomial
• Erratum: Factoring Polynomials over Algebraic Number Fields
• Algorithms in Algebraic Number Theory
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Explicit bounds for primes in residue classes

This page was built for publication: Computing automorphisms of abelian number fields