Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-08T03:57:22.752Z Has data issue: false hasContentIssue false

Cohen–Lenstra heuristics for étale group schemes and symplectic pairings

Published online by Cambridge University Press:  20 March 2019

Michael Lipnowski
Affiliation:
Department of Mathematics, McGill University, Burnside Hall, Room 1005, 805 Sherbrooke Street West, Montreal, QC H3A 0B9, Canada email michael.lipnowski@mcgill.ca
Jacob Tsimerman
Affiliation:
Department of Mathematics, University of Toronto, Bahen Centre, Room 6290, 40 St. George Street, Toronto, ON M5S 2E4, Canada email jacobt@math.toronto.edu
Rights & Permissions [Opens in a new window]

Abstract

We generalize the Cohen–Lenstra heuristics over function fields to é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 $\wedge ^{2}G(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 Malle, Garton, Ellenberg–Venkatesh–Westerland, 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.

Information

Type
Research Article
Copyright
© The Authors 2019