Papers
Topics
Authors
Recent
Search
2000 character limit reached

The monodromy of cyclic Pryms

Published 22 Dec 2025 in math.NT, math.AG, math.CA, and math.GR | (2512.19597v1)

Abstract: The {\em Prym} of a cyclic covering of smooth projective curves is the ``new'' part of the Jacobian: the quotient of the Jacobian of the covering curve by the Jacobians of the intermediate covers. Given a family of such coverings, the fundamental group of the base of the family acts on the Tate modules of the Pryms, and the image of this representation is a key ingredient in answering arithmetic statistics questions about the distribution of the group structure of the LL-torsion of a random Prym in the family. (Over F<em>q{\mathbb{F}}<em>q, the action of Frobenius is roughly uniformly distributed over the {\em arithmetic} monodromy, a coset of the image of the fundamental group of the base change to Fˉq\bar{\mathbb{F}}_q (the {\em geometric} monodromy).) In the present note, we show for a number of natural families that (with limited exceptions) the geometric monodromy is sandwiched between a certain unitary group and its derived subgroup. In particular, this holds for the one-parameter families obtained by starting with any fixed cover and varying one (tame) ramification point. As an application, we deduce analogous largeness results for the monodromy of the Selmer groups of elliptic surfaces with j=0j=0 or j=1728j=1728, by relating them to cyclic covers of degree 6 or 4 respectively, implying that their Selmer groups do not satisfy the standard heuristics. For instance, for eliptic surfaces with j=0j=0 of sufficiently large height over P<sup>1</sup></em>Fq{\mathbb{P}}<sup>1</sup></em>{\mathbb{F}_q}, the average size of the ll-Selmer group is l+3+oq(1)l+3+o_q(1) when ll (fixed) and qq (large) are both 1 mod 3, compared to l+1+oq(1)l+1+o_q(1) for general elliptic surfaces.

Authors (1)

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.