Computing automorphisms of abelian number fields

DOI10.1090/S0025-5718-99-01084-4MaRDI QIDQ4240588zbMATH OpenFDO

Authors Vincenzo Acciaro, Jürgen Klüners

Publication date 28 April 1999

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

Full work available at URL https://doi.org/10.1090/S0025-5718-99-01084-4

zbMATH Keywords

Frobenius automorphismabelian fieldHensel's method

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1075588
• An efficient algorithm for the computation of Galois automorphisms
• Computing normal integral bases of abelian number fields
• scientific article; zbMATH DE number 4200323

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 4200323 (Why is no real title available?)
• scientific article; zbMATH DE number 4170851 (Why is no real title available?)
• scientific article; zbMATH DE number 52177 (Why is no real title available?)
• scientific article; zbMATH DE number 3563269 (Why is no real title available?)
• scientific article; zbMATH DE number 611919 (Why is no real title available?)
• scientific article; zbMATH DE number 194764 (Why is no real title available?)
• scientific article; zbMATH DE number 908573 (Why is no real title available?)
• Algorithms in Algebraic Number Theory
• An inequality for the discriminant of a polynomial
• Efficient rational number reconstruction
• Erratum: Factoring Polynomials over Algebraic Number Fields
• Explicit bounds for primes in residue classes
• Factoring Multivariate Polynomials over Algebraic Number Fields
• KANT V4
• On computing subfields

Cited in

(17)

• Computing splitting fields using Galois theory and other Galois constructions
• An efficient algorithm for the computation of Galois automorphisms
• Deciding the nilpotency of the Galois group by computing elements in the centre
• Algorithms for Function Fields
• Algorithmic search for integer abelian roots of a polynomial with integer abelian coefficients
• Computing with Algebraic Automorphic Forms
• Explicit determination of generalized symmetric and alternating Galois groups
• Computing normal integral bases of abelian number fields
• Finding normal integral bases of cyclic number fields of prime degree
• Computing class fields via the Artin map
• Global automorphic induction for number fields
• Computing local Artin maps, and solvability of norm equations
• Abelian lifts of polynomials
• Sharply \(k\)-transitive permutation groups viewed as Galois groups
• Computing the Abel map
• Galois group computation for rational polynomials
• Explicit Galois realization of transitive groups of degree up to 15

Describes a project that uses

Uses Software

• KANT/KASH

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

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