相关论文: Computing L-Polynomials of Picard curves from Cart…

Let $C$ be a smooth plane quartic curve over $\mathbb{Q}$. Costa, Harvey and Sutherland provide an algorithm with an implementation, improving Harvey's average polynomial-time algorithm, to compute the $\bmod \ p$ reduction of the numerator…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…

Let k be an algebraically closed field of characteristic p > 0. Every Artin-Schreier k-curve X has an equation of the form y^p - y = f(x) for some f(x) in k(x) such that p does not divide the least common multiple L of the orders of the…

Let p be an odd prime. Let K = \Q(zeta) be the p-cyclotomic number field. Let v be a primitive root mod p and sigma : zeta --> zeta^v be a \Q-isomorphism of the extension K/\Q generating the Galois group G of K/\Q. For n in Z, the notation…

Let C/Q be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of Q, but may not have a hyperelliptic model of the usual form over Q. We describe an algorithm that…

Let $C$ be a genus $2$ curve over $\mathbb{Q}$. Harvey and Sutherland's implementation of Harvey's average polynomial-time algorithm computes the $\bmod \ p$ reduction of the numerator of the zeta function of $C$ at all good primes $p\leq…

This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

The zeta function of a curve $C$ over a finite field may be expressed in terms of the characteristic polynomial of a unitary matrix $\Theta_C$. We develop and present a new technique to compute the expected value of…

For an odd prime $p$, we say $f(X) \in {\mathbb F}_p[X]$ computes square roots in $\mathbb F_p$ if, for all nonzero perfect squares $a \in \mathbb F_p$, we have $f(a)^2 = a$. When $p \equiv 3 \mod 4$, it is well known that $f(X) =…

In 1985, Schoof devised an algorithm to compute zeta functions of elliptic curves over finite fields by directly computing the numerators of these rational functions modulo sufficiently many primes (see \cite{schoof_1985}). If $E/K$ is an…

We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field $\mathbb F_q$, with explicit real multiplication by an order $\mathbb Z[\eta]$ in a totally real cubic…

Let $p$ be a prime number, and let $\Delta_1,\Delta_2 < 0$ be two coprime fundamental discriminants. When $p$ splits in $\mathbb{Q}(\sqrt{\Delta_1})$ and $\mathbb{Q}(\sqrt{\Delta_2})$ the height pairings of the corresponding CM divisors on…

For operators on a compact manifold $X$ with boundary $\partial X$, the basic zeta coefficient $C_0(B, P_{1,T})$ is the regular value at $s=0$ of the zeta function $\Tr(B P_{1,T}^{-s})$, where $B=P_++G$ is a pseudodifferential boundary…

We present efficient algorithms for counting points on a smooth plane quartic curve $X$ modulo a prime $p$. We address both the case where $X$ is defined over $\mathbb F_p$ and the case where $X$ is defined over $\mathbb Q$ and $p$ is a…

We study genus $4$ curves over finite fields and two invariants of the $p$-torsion part of their Jacobians: the $a$-number ($a$) and $p$-rank ($f$). We collect and analyze statistical data of curves over $\mathbb{F}_p$ for $p=3,5,7,11$ and…

Let $\mathcal{C}(\mathfrak{p}^r)$ be the rational cuspidal divisor class group of the Drinfeld modular curve $X_0(\mathfrak{p}^r)$ for a prime power level $\mathfrak{p}^r\in \mathbb{F}_q[T]$. We relate the rational cuspidal divisors of…

We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field F_q, which is polynomial in g and log(q). This amounts to giving an algorithm to produce provably random elements of the class group of…

We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…