Recovering the cluster picture of a polynomial over a discretely valued field

恢复离散值域上多项式的聚类图像

阅读:1

Abstract

For f(x) , a separable polynomial of degree d over a discretely valued field K , we describe how the cluster picture of f(x) over K , in other words, the set of tuples {(ord(xi - xj), i, j):1 ≤ i < j ≤ d} , where x1, …, xd are the roots of f(x) , can be recovered without knowing the roots of f(x) over K¯ . We construct an explicit list of polynomials gd(1), …, gd(td) ∈ ℤ[A0, …, Ad-1] such that the valuations ord(gd(i)(a0, …, ad-1)) for i = 1, …, td uniquely determine this set of distances for the polynomial f(x) = cf(xd + ad-1xd-1 +  ⋯  + a0) , and we describe the process by which they do so. We use this to deduce that if C:y2 = f(x) is a hyperelliptic curve over a local field K . This list of valuations of polynomials in the coefficients of f(x) uniquely determines the dual graph of the special fibre of the minimal strict normal crossings model of C/Kunr , the inertia action on the Tate module and the conductor exponent. This provides a hyperelliptic curves analogue to a corollary of Tate's algorithm, that in residue characteristic p ≥ 5 , the dual graph of special fibre of the minimal regular model of an elliptic curve E/Kunr is uniquely determined by the valuation of jE and ΔE .

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。