Local computation of differents and discriminants

DOI10.1090/S0025-5718-2013-02754-8zbMath1330.11082arXiv1205.1340MaRDI QIDQ5401713

Enric Nart Viñals

Publication date: 12 March 2014

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

Newton polygon; different; discriminant; local field; resultant; global field; Montes algorithm; OM representation; Okutsu invariant; single-factor lifting algorithm

Mathematics Subject Classification ID

11Y40: Algebraic number theory computations

11R04: Algebraic numbers; rings of algebraic integers

11S05: Polynomials

Related Items

A new computational approach to ideal theory in number fields, On the equivalence of types, Residual ideals of MacLane valuations

Cites Work

• Unnamed Item
• Unnamed Item
• A new computational approach to ideal theory in number fields
• Single-factor lifting and factorization of polynomials over local fields
• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Okutsu-Montes representations of prime ideals of one-dimensional integral closures
• An inequality for the discriminant of a polynomial
• Fast multiplication of large numbers
• Okutsu invariants and Newton polygons
• On the Complexity of the Montes Ideal Factorization Algorithm
• Factoring Polynomials over Local Fields II
• Complexity of OM factorizations of polynomials over local fields
• Newton polygons of higher order in algebraic number theory