整闭包的三角形底
Triangular bases of integral closures
摘要:
本文研究了一维局部环的整闭包的三角基的计算问题。设$(K, v)$是一个具有赋值环$\mathcal{O}$的离散域,$\mathfrak{m}$是极大理想.我们取$f \in \mathcal{O}[x]$,一个一元不可约的$n$次多项式,考虑它的扩张$L = K[x]/(f(x))$和$\mathcal{O}_{L}$,它是$\mathcal{O}$在$L$中的积分闭包,我们假设它是由一个$\mathcal{O}$ -模生成的.本文给出了计算$\mathcal{O}_{L}$的分式理想的三角基的算法$\operatorname{MaxMin}$.理论上的复杂性相当于目前最先进的方法,在实践中几乎总是更快。它也比标准计算机代数系统中的例程快得多,除了一些涉及非常小的字段扩展的情况。
英文摘要:
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 $\mathcal{O}$ and let $\mathfrak{m}$ be the maximal ideal. We take $f \in \mathcal{O}[x]$, a monic irreducible polynomial of degree $n$ and consider the extension $L = K[x]/(f(x))$ as well as $\mathcal{O}_{L}$ the integral closure of $\mathcal{O}$ in $L$, which we suppose to be finitely generated as an $\mathcal{O}$-module. The algorithm $\operatorname{MaxMin}$, presented in this paper, computes triangular bases of fractional ideals of $\mathcal{O}_{L}$. 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。