首页> 外文学位 >Norm-Euclidean Galois fields.
【24h】

Norm-Euclidean Galois fields.

机译:规范欧几里得伽罗瓦域。

获取原文
获取原文并翻译 | 示例

摘要

In this work, we study norm-Euclidean Galois number fields. In the quadratic setting, it is known that there are finitely many and they have been classified. In 1951, Heilbronn showed that for each odd prime ℓ, there are finitely many norm-Euclidean Galois fields of degree ℓ. Unfortunately, his proof does not provide an upper bound on the discriminant, even in the cubic case. We give, for the first time, an upper bound on the discriminant for this class of fields. Namely, for each odd prime ℓ we give an upper bound on the discriminant of norm-Euclidean Galois fields of degree ℓ.;In Chapter 3, we derive various inequalities which guarantee the failure of the norm-Euclidean property. Our inequalities involve the existence of small integers satisfying certain splitting and congruence conditions; this reduces the problem to the study of character non-residues. This also leads to an algorithm for tabulating a list of candidate norm-Euclidean Galois fields (of prime degree ℓ) up to a given discriminant. We have implemented this algorithm and give some numerical results when ℓ 30. The cubic case is especially interesting as Godwin and Smith have classified all norm-Euclidean Galois cubic fields with |Delta| 108. Using an efficient implementation of our algorithm, we extend their classification to include all fields with |Delta| 1020.;In Chapter 4, we turn to the study of character non-residues. In §4.1, we give a new estimate of the second smallest prime non-residue, and in §4.2, we derive an explicit version of a character sum estimate due to Burgess following a method of Iwaniec. In Chapter 5, we combine a result of Norton on the smallest non-residue with our results from Chapter 4 to obtain the aforementioned discriminant bounds. In Chapter 6, we give strengthened versions of all our results assuming the Generalized Riemann Hypothesis.;Finally, in Chapter 7, we summarize what our results say in the cubic case and use a combination of theory and computation to give, assuming the GRH, a complete determination of all norm-Euclidean Galois cubic fields.
机译:在这项工作中,我们研究了标准欧几里德伽罗瓦数域。在二次方的情况下,已知数量有限且已被分类。 1951年,海尔布隆证明,对于每个奇数素数&ell ;,都有一定数量的范数欧氏伽罗瓦数域&ell;。不幸的是,即使在立方情况下,他的证明也不能提供判别的上限。我们首次给出了此类字段判别的上限。即,对于每个奇数素数&ell;我们给出了判别度为-ell的规范欧几里德伽罗瓦域的上限。在第三章中,我们推导出了各种不等式,这些不等式保证了规范欧几里德性质的失败。我们的不等式包括满足某些分裂和同余条件的小整数的存在;这就减少了字符非残基研究的麻烦。这也导致了一种算法,用于将候选范数-欧几里德伽罗瓦域(素数为&ell;)的列表汇总到给定的判别式。我们已经实现了该算法,并在&ell;时给出了一些数值结果。 <30.三次案例尤为有趣,因为戈德温和史密斯已将所有范数欧几里德伽罗瓦三次域都分类为| <108.使用我们的算法的有效实现,我们将其分类扩展为包括具有| Delta |的所有字段。 <1020 .;在第4章中,我们转向字符非残基的研究。在§4.1中,我们给出了第二小的素数非残基的新估计,在§4.2中,我们遵循Iwaniec方法得出了由于伯吉斯而产生的字符和估计的显式形式。在第5章中,我们将最小残数上的Norton结果与第4章中的结果相结合,以获得上述判别边界。在第6章中,我们给出了广义黎曼假设的所有结果的增强版本。最后,在第7章中,我们总结了在立方情况下我们的结果,并使用理论和计算的组合给出了GRH,完整确定所有标准欧几里得伽罗瓦立方场。

著录项

  • 作者

    McGown, Kevin Joseph.;

  • 作者单位

    University of California, San Diego.;

  • 授予单位 University of California, San Diego.;
  • 学科 Mathematics.
  • 学位 Ph.D.
  • 年度 2010
  • 页码 101 p.
  • 总页数 101
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号