arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0009255math.NT
收藏

在p点非分歧的Galois p-群的显式计算

Explicit computation of Galois p-groups unramified at p

Nigel Boston, Charles Leedham-Green

摘要:

本文介绍一种用计算机求伽罗瓦群的新方法。这在p-扩张的伽罗瓦群在许多素数处分歧但在p以上的素数处不分歧的情况下特别有效。这样的伽罗瓦群被认为是数论中最神秘的对象之一。很少有迄今为止发现关于他们尽管他们的重要性,在研究p进伽罗瓦表示unramified在p.的extractures的Fontaine马祖尔说,他们不应该有p进的分析subjectents(相当于,图像的伽罗瓦表示应始终是有限的),并有概括由于第一作者,建议他们应该,而不是有“大”行动的某些树木。我们的想法是修改p-群生成算法,使其在进行过程中,使用数论信息来消除不能作为所研究的伽罗瓦群的合适子群出现的群。在最好的情况下,我们得到一个简短的名单候选人的伽罗瓦群。这导致了各种各样的麻烦。

英文摘要:

In this paper we introduce a new method for finding Galois groups by computer. This is particularly effective in the case of Galois groups of p-extensions ramified at finitely many primes but unramified at the primes above p. Such Galois groups have been regarded as amongst the most mysterious objects in number theory. Very little has hitherto been discovered regarding them despite their importance in studying p-adic Galois representations unramified at p. The conjectures of Fontaine-Mazur say that they should have no p-adic analytic quotients (equivalently, the images of the Galois representations should always be finite), and there are generalizations due to the first author, suggesting that they should instead have `large' actions on certain trees. The idea is to modify the p-group generation algorithm so that as it goes along, it uses number-theoretical information to eliminate groups that cannot arise as suitable quotients of the Galois group under investigation. In the best cases we obtain a short list of candidates for the Galois group. This leads to various conjectures.

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

↑