Computing subfields of number fields and applications to Galois group computations

DOI10.1016/J.JSC.2018.04.013MaRDI QIDQ1733297zbMATH OpenOpenAlexWikidataFDO

Authors Andreas-Stephan Elsenhans, Jürgen Klüners

Publication date 21 March 2019

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

Full work available at URL https://arxiv.org/abs/1610.06837

zbMATH Keywords

Galois groupLLLnumber fieldssubfields

Mathematics Subject Classification ID

Galois theory (11R32) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Symbolic computation and algebraic computation (68W30)

Abstract: A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new concept of Galois-generating subfields. In general this is a very small set of subfields that determine all other subfields in a group-theoretic way. We compute them by targeted calls to the method from van Hoeij et al. For an early termination of these calls, we give a list of criteria that imply that further calls will not result in additional subfields. Finally, we explain how we use subfields to get a good starting group for the computation of Galois groups.

Recommendations

• On computing subfields. A detailed description of the algorithm
• scientific article; zbMATH DE number 1075588
• Generating subfields
• scientific article; zbMATH DE number 4200323
• Block Systems of a Galois Group

Cites work

• A note on short cosets
• Computation of Galois groups of rational polynomials
• Constructing transitive permutation groups.
• Endliche Gruppen I
• Factoring polynomials with rational coefficients
• Fast computation of special resultants
• Generating subfields
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• Improved methods for the construction of relative invariants for permutation groups
• nauty
• On computing subfields. A detailed description of the algorithm
• Practical graph isomorphism. II.
• The Determination of Galois Groups
• The Magma algebra system. I: The user language
• The Transitive Permutation Groups of Degree 32
• Transitive permutation groups of prime-squared degree

Cited in

(9)

• On computing subfields. A detailed description of the algorithm
• The complexity of computing all subfields of an algebraic number field
• Generating subfields
• Computing groups of Hecke characters
• scientific article; zbMATH DE number 421665 (Why is no real title available?)
• Block Systems of a Galois Group
• Factorization and root-finding for polynomials over division quaternion algebras
• Computing Galois groups
• Computing quadratic subfields of number fields

Describes a project that uses

Uses Software

• nauty
• Magma
• Traces

This page was built for publication: Computing subfields of number fields and applications to Galois group computations

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