On computing subfields. A detailed description of the algorithm

DOI10.5802/jtnb.227zbMath0935.11047MaRDI QIDQ1292617

Jürgen Klüners

Publication date: 23 June 1999

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_1998__10_2_243_0

zbMATH Keywords

subfields; block systems

Mathematics Subject Classification ID

11R32: Galois theory

11Y40: Algebraic number theory computations

Related Items

An efficient algorithm for the computation of Galois automorphisms, Algorithms for Function Fields, Galois group computation for rational polynomials, Explicit Galois realization of transitive groups of degree up to 15, A polynomial with Galois group \(\text{SL}_2(11)\), Unnamed Item, Factorization and root-finding for polynomials over division quaternion algebras, Topics in computational algebraic number theory, Computing subfields of number fields and applications to Galois group computations, The complexity of computing all subfields of an algebraic number field, Numerical calculation of three-point branched covers of the projective line

Uses Software

• KANT/KASH

Cites Work

• Solvability by radicals is in polynomial time
• KANT V4
• On computing subfields
• Efficient rational number reconstruction
• Ideal decompositions and subfields
• Factoring Polynomials over Algebraic Number Fields
• A polynomial reduction algorithm
• An Inequality About Factors of Polynomials
• Factoring Polynomials Over Algebraic Number Fields
• Imprimitive Ninth-Degree Number Fields with Small Discriminants
• Block Systems of a Galois Group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item