arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0902.3428math.NT
收藏

高等牛顿多边形与整基

Higher Newton polygons and integral bases

J. Guardia, J. Montes, E. Nart

摘要:

设$A$是Dedekind整环,$K$是分式域,$\p$是$A$的非零素理想,$K_\pp$是$K$关于$\p$ -adic拓扑的完备化. Montes算法以一元不可约可分多项式$f(x)\in A[x]$为输入,确定了$K_\pp[x]$上的$f(x)$的因式分解,并提供了由不同不可约因子确定的$K_\pp$的有限扩张的基本算术信息.特别地,它可以用于计算由$f(x)$ \cite{newapp}确定的$K$的扩张的$\p$ -整基。在本文中,我们提出了新的(和更快的)方法来计算$\p$ -整基,根据使用的某些部门的同数项的剩余$f(x)$发生沿蒙特斯算法的流程。

英文摘要:

Let $A$ be a Dedekind domain, $K$ the fraction field, $\p$ a non-zero prime ideal of $A$, and $K_\pp$ the completion of $K$ with respect to the $\p$-adic topology. At the input of a monic irreducible separable polynomial, $f(x)\in A[x]$, Montes algorithm determines the factorization of $f(x)$ over $K_\pp[x]$, and it provides essential arithmetic information about the finite extensions of $K_\pp$ determined by the different irreducible factors. In particular, it can be used to compute $\p$-integral bases of the extension of $K$ determined by $f(x)$ \cite{newapp}. In this paper we present new (and faster) methods to compute $\p$-integral bases, based on the use of the quotients of certain divisions with remainder of $f(x)$ that occur along the flow of Montes algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑