Isomorphisms of algebraic number fields

DOI10.5802/JTNB.797MaRDI QIDQ713173zbMATH OpenOpenAlexFDO

Authors Mark van Hoeij, Vivek Pal

Publication date 26 October 2012

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

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

zbMATH Keywords

number fieldsisomorphismcomputational number theory

Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Algebraic number theory computations (11Y40)

Abstract: Let $mathbbQ(alpha)$ and $$ be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, $$. The algorithm is particularly efficient if the number of isomorphisms is one.

Recommendations

• Explicit computation of isomorphisms between finite fields
• Finding Isomorphisms Between Finite Fields
• scientific article; zbMATH DE number 1075588
• Polynomial computability of fields of algebraic numbers
• scientific article; zbMATH DE number 4200323

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• A heuristic irreducibility test for univariate polynomials
• A relative van Hoeij algorithm over number fields
• Bounding the coefficients of a divisor of a given polynomial
• Factoring polynomials and the knapsack problem
• Factoring polynomials with rational coefficients
• Sharp estimates for triangular sets

Cited in

(5)

• On computing subfields. A detailed description of the algorithm
• The complexity of computing all subfields of an algebraic number field
• On the effective computation of isomorphisms between and GF
• On Computing Isomorphisms of Equation Orders
• Improved computation of polynomial roots over number fields when using complex embeddings

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Isomorphisms of algebraic number fields

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