Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cohen Lenstra Heuristics for Étale Group Schemes and Symplectic Pairings

Published 28 Oct 2016 in math.NT | (1610.09304v1)

Abstract: We generalize the Cohen-Lenstra heuristics over function fields to \'{e}tale group schemes $G$ (with the classical case of abelian groups corresponding to constant group schemes). By using the results of Ellenberg-Venkatesh-Westerland, we make progress towards the proof of these heuristics. Moreover, by keeping track of the image of the Weil-pairing as an element of $\wedge2G(1)$, we formulate more refined heuristics which nicely explain the deviation from the usual Cohen-Lenstra heuristics for abelian $\ell$-groups in cases where $\ell\mid q-1$; the nature of this failure was suggested already in the works of Garton, EVW, and others. On the purely large random matrix side, we provide a natural model which has the correct moments, and we conjecture that these moments uniquely determine a limiting probability measure.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.