Computing L-Polynomials of Picard curves from Cartier-Manin matrices

Abstract

We study the sequence of zeta functions Z(Cp,T) of a generic Picard curve C:y3=f(x) defined over Q at primes p of good reduction for C. We define a degree 9 polynomial f∈ Q[x] such that the splitting field of f(x3/2) is the 2-torsion field of the Jacobian of C. We prove that, for all but a density zero subset of primes, the zeta function Z(Cp,T) is uniquely determined by the Cartier-Manin matrix Ap of C modulo p and the splitting behavior modulo p of f and f; we also show that for primes 1 3 the matrix Ap suffices and that for primes 2 3 the genericity assumption on C is unnecessary. An element of the proof, which may be of independent interest, is the determination of the density of the set of primes of ordinary reduction for a generic Picard curve. By combining this with recent work of Sutherland, we obtain a practical deterministic algorithm that computes Z(Cp,T) for almost all primes p N using N(N)3+o(1) bit operations. This is the first practical result of this type for curves of genus greater than 2.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…