论类型的等价性
On the equivalence of types
摘要:
离散值域$(K,v)$上的类型是计算对象,其参数化$K_v[x]$中的某些一元不可约多项式族,其中$K_v$是$v$处的$K$的完成。两种类型被认为是等价的,如果他们编码相同的家庭的素数多项式。在本文中,我们的等价类型的某些数据支持他们的特点。
英文摘要:
Types over a discrete valued field $(K,v)$ are computational objects that parameterize certain families of monic irreducible polynomials in $K_v[x]$, where $K_v$ is the completion of $K$ at $v$. Two types are considered to be equivalent if they encode the same family of prime polynomials. In this paper, we characterize the equivalence of types in terms of certain data supported by them.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。