On computing subfields. A detailed description of the algorithm

DOI10.5802/JTNB.227zbMATH Open0935.11047OpenAlexW2328143117MaRDI QIDQ1292617FDOQ1292617

Authors: 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

Recommendations

• Block Systems of a Galois Group
• Computing subfields of number fields and applications to Galois group computations
• scientific article; zbMATH DE number 1075588
• Generating subfields
• Generating subfields
• scientific article; zbMATH DE number 4200323
• The complexity of computing all subfields of an algebraic number field
• Isomorphisms of algebraic number fields
• Subexponential algorithms for class group and unit computations
• Reducing number field defining polynomials: an application to class group computations

zbMATH Keywords

subfieldsblock systems

Mathematics Subject Classification ID

Galois theory (11R32) Algebraic number theory computations (11Y40)

Cites Work

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

Cited In (15)

• An efficient algorithm for the computation of Galois automorphisms
• Block Systems of a Galois Group
• Factorization and root-finding for polynomials over division quaternion algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for Function Fields
• 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
• Generating subfields
• Numerical calculation of three-point branched covers of the projective line
• Computing Galois groups
• A polynomial with Galois group \(\text{SL}_2(11)\)
• Galois group computation for rational polynomials
• Explicit Galois realization of transitive groups of degree up to 15

Uses Software

• KANT/KASH

This page was built for publication: On computing subfields. A detailed description of the algorithm

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