arXivDaily arXiv每日学术速递 周一至周五更新
看起来今天可以划水了
arXiv 1003.1287math.NT
收藏

用三次域制表法计算高三阶二次函数域

Computing quadratic function fields with high 3-rank via cubic field tabulation

Pieter Rozenhart, Michael Jacobson, Renate Scheidler

摘要:

本文提出了一种算法,用于生成所有的虚的和不寻常的判别式,直到一个固定的程度界,定义了一个二次函数域的正3-秩。我们的方法利用函数场的适应性的方法,由于Belabas寻找二次数域的高3秩和一个完善的函数场版本的定理,由于哈塞。我们提供了数值数据的判别度高达11上的有限域$\mathbb{F}_{5}, \mathbb{F}_{7}, \mathbb{F}_{11}$和$\mathbb{F}_{13}$。我们的技术的一个特点是,它产生的二次函数领域的最小亏格为任何给定的3-秩。利用某些$\mathbb{F}_{q}(t)$ -自同构结合霍纳的规则,以评估多项式显着加快我们的算法在假想的情况下,这种改进是唯一的功能领域,并不适用于数域制表。这些自同构也解释了具有正3秩的域的数量中的某些整除性质。我们的数值结果与Friedman-Washington的预测结果以及Ellenberg-Venkatesh-Westerland关于有限域$\finfldq{q}$上二次函数域的分布的部分结果基本一致,其中$q \equiv -1 \pmod{3}$ .相应的数据$q \equiv 1 \pmod{3}$不同意密切与前面提到的数学和结果,但同意更密切与最近的一些数域的代数Malle和一些工作正在进行中的证明这种代数的功能领域由于加顿。

英文摘要:

This paper presents an algorithm for generating all imaginary and unusual discriminants up to a fixed degree bound that define a quadratic function field of positive 3-rank. Our method makes use of function field adaptations of a method due to Belabas for finding quadratic number fields of high 3-rank and of a refined function field version of a theorem due to Hasse. We provide numerical data for discriminant degree up to 11 over the finite fields $\mathbb{F}_{5}, \mathbb{F}_{7}, \mathbb{F}_{11}$ and $\mathbb{F}_{13}$. A special feature of our technique is that it produces quadratic function fields of minimal genus for any given 3-rank. Taking advantage of certain $\mathbb{F}_{q}(t)$-automorphisms in conjunction with Horner's rule for evaluating polynomials significantly speeds up our algorithm in the imaginary case; this improvement is unique to function fields and does not apply to number field tabulation. These automorphisms also account for certain divisibility properties in the number of fields found with positive 3-rank. Our numerical data mostly agrees with the predicted heuristics of Friedman-Washington and partial results on the distribution of such values due to Ellenberg-Venkatesh-Westerland for quadratic function fields over the finite field $\finfldq{q}$ where $q \equiv -1 \pmod{3}$. The corresponding data for $q \equiv 1 \pmod{3}$ does not agree closely with the previously mentioned heuristics and results, but does agree more closely with some recent number field conjectures of Malle and some work in progress on proving such conjectures for function fields due to Garton.

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

↑