Computation of triangular integral bases

DOI10.2140/obs.2019.2.69OpenAlexW2913451037WikidataQ128413176 ScholiaQ128413176MaRDI QIDQ6165856

Ha Thanh Nguyen Tran, Jens-Dietrich Bauch

Publication date: 2 August 2023

Published in: The Open Book Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/obs.2019.2.69

zbMATH Keywords

Dedekind domainmaximal ordermontes algorithmp-integral bases

Mathematics Subject Classification ID

Integral closure of commutative rings and ideals (13B22) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of integral bases
• A new computational approach to ideal theory in number fields
• Single-factor lifting and factorization of polynomials over local fields
• Higher Newton polygons and integral bases
• Construction and estimation of bases in function fields
• Implementing the Round Four maximal order algorithm
• Triangular bases of integral closures
• An algorithm for computing an integral basis in an algebraic function field
• Fast multiplication of large numbers
• Complexity of OM factorizations of polynomials over local fields

This page was built for publication: Computation of triangular integral bases