ﻻ يوجد ملخص باللغة العربية
We study the sequence of zeta functions $Z(C_p,T)$ of a generic Picard curve $C:y^3=f(x)$ defined over $mathbb{Q}$ at primes $p$ of good reduction for $C$. We define a degree 9 polynomial $psi_fin mathbb{Q}[x]$ such that the splitting field of $psi_f(x^3/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(C_p,T)$ is uniquely determined by the Cartier-Manin matrix $A_p$ of $C$ modulo $p$ and the splitting behavior modulo $p$ of $f$ and $psi_f$; we also show that for primes $equiv 1 pmod{3}$ the matrix $A_p$ suffices and that for primes $equiv 2 pmod{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(C_p,T)$ for almost all primes $p le N$ using $Nlog(N)^{3+o(1)}$ bit operations. This is the first practical result of this type for curves of genus greater than 2.
We analyze the distribution of unitarized L-polynomials Lp(T) (as p varies) obtained from a hyperelliptic curve of genus g <= 3 defined over Q. In the generic case, we find experimental agreement with a predicted correspondence (based on the Katz-Sar
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.
We give an explicit description of the stable reduction of superelliptic curves of the form $y^n=f(x)$ at primes $p$ whose residue characteristic is prime to the exponent $n$. We then use this description to compute the local $L$-factor of the curve and the exponent of conductor at $p$.
We describe normal forms and minimal models of Picard curves, discussing various arithmetic aspects of these. We determine all so-called special Picard curves over $mathbb{Q}$ with good reduction outside 2 and 3, and use this to determine the smalles
We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An implementation