Triangular bases of integral closures

From MaRDI portal




Abstract: In this work, we consider the problem of computing triangular bases of integral closures of one-dimensional local rings. Let (K,v) be a discrete valued field with valuation ring mathcalO and let mathfrakm be the maximal ideal. We take finmathcalO[x], a monic irreducible polynomial of degree n and consider the extension L=K[x]/(f(x)) as well as mathcalOL the integral closure of mathcalO in L, which we suppose to be finitely generated as an mathcalO-module. The algorithm operatornameMaxMin, presented in this paper, computes triangular bases of fractional ideals of mathcalOL. The theoretical complexity is equivalent to current state of the art methods and in practice is almost always faster. It is also considerably faster than the routines found in standard computer algebra systems, excepting some cases involving very small field extensions.





Describes a project that uses

Uses Software





This page was built for publication: Triangular bases of integral closures

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