Fast integral bases computation

DOI10.1007/978-3-031-69070-9_17MaRDI QIDQ6660337zbMATH OpenFDO

Authors Adrien Poteaux, Martin Weimann

Publication date 10 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-69070-9_17

zbMATH Keywords

fieldsfractional idealsintegral basesOM algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• A Construction for Absolute Values in Polynomial Rings
• A construction for prime ideals as absolute values of an algebraic field.
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• A new computational approach to ideal theory in number fields
• An algorithm for computing an integral basis in an algebraic function field
• Complexity of OM factorizations of polynomials over local fields
• Computation of integral bases
• Computing integral bases via localization and Hensel lifting
• Computing local integral closures
• Computing Riemann-Roch spaces in algebraic function fields and related topics.
• Construction of integral basis. I
• Construction of integral basis. IV
• Directed evaluation
• Elimination ideal and bivariate resultant over finite fields
• Higher Newton polygons and integral bases
• scientific article; zbMATH DE number 729452 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• Local computation of differents and discriminants
• Modern computer algebra
• Newton polygons of higher order in algebraic number theory
• On the complexity of computing integral bases of function fields
• Triangular bases of integral closures

Cited in

(1)

• On OM algorithms and cluster pictures

This page was built for publication: Fast integral bases computation

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