arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.5129math.CO
收藏

关于随机图Jacobian的Cohen-Lenstra启发式

On a Cohen-Lenstra Heuristic for Jacobians of Random Graphs

Julien Clancy, Nathan Kaplan, Timothy Leake, Sam Payne, Melanie Matchett Wood

摘要:

本文对具有典型对偶对的随机图的雅可比行列式的分布作了具体的讨论。我们的结构是基于一个科恩-伦斯特拉型启发式说,一个有限的阿贝尔群对偶配对出现的频率成反比的大小的组倍的大小的自同构群,保持配对。我们猜想一个随机图的雅可比矩阵是循环的概率略高于0.7935。我们确定的值的其他几个统计雅可比随机图,将遵循我们的代数。为了支持这些结论,我们证明了p-adic整数上的随机对称矩阵,若按Haar测度分布,其上核也按上述启发式分布.我们也给出了实验证据来支持我们的理论。

英文摘要:

In this paper, we make specific conjectures about the distribution of Jacobians of random graphs with their canonical duality pairings. Our conjectures are based on a Cohen-Lenstra type heuristic saying that a finite abelian group with duality pairing appears with frequency inversely proportional to the size of the group times the size of the group of automorphisms that preserve the pairing. We conjecture that the Jacobian of a random graph is cyclic with probability a little over .7935. We determine the values of several other statistics on Jacobians of random graphs that would follow from our conjectures. In support of the conjectures, we prove that random symmetric matrices over the p-adic integers, distributed according to Haar measure, have cokernels distributed according to the above heuristic. We also give experimental evidence in support of our conjectures.

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

↑