Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
From MaRDI portal
Publication:449717
DOI10.5802/JTNB.782zbMATH Open1266.11131arXiv0807.4065OpenAlexW2963254673MaRDI QIDQ449717FDOQ449717
Authors: Jesús Montes, Jordi Guárdia, Enric Nart 
Publication date: 31 August 2012
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Abstract: We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory requirements of the algorithm appear to be very good: for a given prime number p, it computes the p-valuation of the discriminant and the factorization of p in a number field of degree 1000 in a few seconds, in a personal computer.
Full work available at URL: https://arxiv.org/abs/0807.4065
Recommendations
- Newton polygons of higher order in algebraic number theory
- Polynomial factorization algorithms over number fields
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Intrinsic factorization of ideals in Dedekind domains
- scientific article; zbMATH DE number 1276815
- scientific article; zbMATH DE number 3968703
- Factoring polynomials over local fields.
- Factoring Polynomials over Algebraic Number Fields
- scientific article; zbMATH DE number 4069018
- scientific article; zbMATH DE number 3860385
Algebraic numbers; rings of algebraic integers (11R04) Ramification and extension theory (11S15) Polynomials (irreducibility, etc.) (11R09) Class numbers, class groups, discriminants (11R29) Polynomials (11S05) Algebraic number theory computations (11Y40)
Cites Work
- Higher Newton polygons and integral bases
- Newton polygons of higher order in algebraic number theory
- Implementing the Round Four maximal order algorithm
- A new computational approach to ideal theory in number fields
- Single-factor lifting and factorization of polynomials over local fields
- Okutsu invariants and Newton polygons
- On the Complexity of the Montes Ideal Factorization Algorithm
- Factoring polynomials over local fields. II
- Approximating rings of integers in number fields
- Title not available (Why is that?)
- The construction of maximal orders over a Dedekind domain
- A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Construction of integral basis. II
Cited In (33)
- Discriminants of Chebyshev radical extensions
- Newton polygons of higher order in algebraic number theory
- Higher Newton polygons and integral bases
- Complexity of OM factorizations of polynomials over local fields
- Computation of integral bases
- A new computational approach to ideal theory in number fields
- Single-factor lifting and factorization of polynomials over local fields
- Okutsu-Montes representations of prime ideals of one-dimensional integral closures
- Super-linear convergence in the p -adic QR-algorithm
- Discriminants of simplest \(3^n\)-tic extensions
- Factoring polynomials over local fields. II
- Sparse discriminants and applications
- Computing with quadratic forms over number fields
- Prime ideal factorization in a number field via Newton polygons
- Computation of residual polynomial operators of inductive valuations
- Genus computation of global function fields
- Computing the length of sum of squares and Pythagoras element in a global field
- On Computing the Discriminant of an Algebraic Number Field
- NEWTON POLYHEDRA AND AN ALGORITHM FOR COMPUTING HODGE–DELIGNE NUMBERS
- Newton polygons and \(p\)-integral bases of quartic number fields
- The anisotropic part of a quadratic form over a number field
- Lifting Artin-Schreier covers with maximal wild monodromy
- Class numbers of large degree nonabelian number fields
- On common index divisors and not monogenity of nonic number fields defined by trinomials of type $$x^9+ax+b$$
- Triangular bases of integral closures
- On the discriminant of pure number fields
- Factoring formal power series over principal ideal domains
- Computing Galois groups by means of Newton polygons
- On the Complexity of the Montes Ideal Factorization Algorithm
- On the equivalence of types
- On common index divisors and monogenity of septic number fields defined by trinomials of type \(x^7 + ax^2 + b\)
- Local computation of differents and discriminants
- Computing an order-complete basis for \(M^{\infty}(N)\) and applications
This page was built for publication: Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449717)
