Computing subfields of number fields and applications to Galois group computations

DOI10.1016/j.jsc.2018.04.013zbMath1419.11142arXiv1610.06837OpenAlexW2963138639WikidataQ130002429 ScholiaQ130002429MaRDI QIDQ1733297

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 groupnumber fieldssubfieldsLLL

Mathematics Subject Classification ID

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

Related Items (3)

Factorization and root-finding for polynomials over division quaternion algebras ⋮ Unnamed Item ⋮ Computing groups of Hecke characters

Uses Software

• Magma
• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• nauty
• Improved methods for the construction of relative invariants for permutation groups
• Factoring polynomials with rational coefficients
• On computing subfields. A detailed description of the algorithm
• The Magma algebra system. I: The user language
• Transitive permutation groups of prime-squared degree
• Generating subfields
• Gradual sub-lattice reduction and a new complexity for factoring polynomials
• Practical graph isomorphism. II.
• Constructing transitive permutation groups.
• Fast computation of special resultants
• The Transitive Permutation Groups of Degree 32
• The Determination of Galois Groups
• Computation of Galois groups of rational polynomials
• A Note on Short Cosets
• Endliche Gruppen I

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