Cohen Lenstra Heuristics for \'Etale Group Schemes and Symplectic Pairings
Michael Lipnowski, Jacob Tsimerman

TL;DR
This paper extends Cohen-Lenstra heuristics to étale group schemes over function fields, incorporating Weil pairings, and proposes refined models to explain deviations observed in specific cases.
Contribution
It generalizes Cohen-Lenstra heuristics to étale group schemes, introduces refined heuristics involving Weil pairings, and develops a new random matrix model matching observed moments.
Findings
Progress towards proving the heuristics using Ellenberg-Venkatesh-Westerland results
Refined heuristics explaining deviations when llivides q-1
A new random matrix model with correct moments and conjectured unique measure
Abstract
We generalize the Cohen-Lenstra heuristics over function fields to \'{e}tale group schemes (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 , we formulate more refined heuristics which nicely explain the deviation from the usual Cohen-Lenstra heuristics for abelian -groups in cases where ; 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
