A new computational approach to ideal theory in number fields

DOI10.1007/S10208-012-9137-5zbMATH Open1287.11142arXiv1005.1156OpenAlexW2071102429MaRDI QIDQ385455FDOQ385455

Authors: Jesús Montes, Enric Nart, Jordi Guárdia 

Publication date: 2 December 2013

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Abstract: Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coefficients. In previous papers we parameterized the prime ideals of $K$ in terms of certain invariants attached to Newton polygons of higher order of the defining equation $f(x)$. In this paper we show how to carry out the basic operations on fractional ideals of $K$ in terms of these constructive representations of the prime ideals. From a computational perspective, these results facilitate the manipulation of fractional ideals of $K$ avoiding two heavy tasks: the construction of the maximal order of $K$ and the factorization of the discriminant of $f(x)$. The main computational ingredient is Montes algorithm, which is an extremely fast procedure to construct the prime ideals.

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

Recommendations

• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• On Computing the Discriminant of an Algebraic Number Field
• Okutsu-Montes representations of prime ideals of one-dimensional integral closures
• Higher Newton polygons and integral bases
• scientific article; zbMATH DE number 1113822

zbMATH Keywords

ideal decompositiondiscriminantMontes algorithmOM representation

Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Polynomials (irreducibility, etc.) (11R09) Units and factorization (11R27) Class numbers, class groups, discriminants (11R29) Factorization (11Y05) Algebraic number theory computations (11Y40)

Cites Work

• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Higher Newton polygons and integral bases
• Newton polygons of higher order in algebraic number theory
• Construction of integral basis. I
• Single-factor lifting and factorization of polynomials over local fields
• Complexity of OM factorizations of polynomials over local fields
• Computing Riemann-Roch spaces in algebraic function fields and related topics.
• A construction for prime ideals as absolute values of an algebraic field
• Okutsu invariants and Newton polygons
• On the Complexity of the Montes Ideal Factorization Algorithm
• Factoring polynomials over local fields. II
• Local computation of differents and discriminants

Cited In (20)

• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Higher Newton polygons and integral bases
• Computation of integral bases
• Computing the Length of Sum of Squares and Pythagoras Element in a Global Field
• Okutsu-Montes representations of prime ideals of one-dimensional integral closures
• Computation of triangular integral bases
• Residual ideals of MacLane valuations
• Computing with quadratic forms over number fields
• Valuations with an infinite limit-depth
• Computational ideal theory in finitely generated extension rings
• Enumerating extensions of (π)-adic fields with given invariants
• Defectless polynomials over Henselian fields and inductive valuations
• The anisotropic part of a quadratic form over a number field
• Square-free OM computation of global integral bases
• How far is an extension of \(p\)-adic fields from having a normal integral basis?
• Triangular bases of integral closures
• On the discriminant of pure number fields
• Fast integral bases computation
• On the equivalence of types
• Local computation of differents and discriminants

Uses Software

• Magma

This page was built for publication: A new computational approach to ideal theory in number fields

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