相关论文: Point counting in families of hyperelliptic curves…

Consider a hyperelliptic curve of genus $2$ over a field $K$ of characteristic zero. After extending $K$ we can view it as a marked curve with its $6$ Weierstrass points. We classify the structure of the potentially stable reduction of such…

Tate's algorithm tells us that for an elliptic curve $E$ over a local field $K$ of residue characteristic $\geq 5$, $E/K$ has potentially good reduction if and only if $\text{ord}(j_E)\geq 0$. It also tells us that when $E/K$ is semistable…

We find a closed formula for the number $\operatorname{hyp}(g)$ of hyperelliptic curves of genus $g$ over a finite field $k=\mathbb{F}_q$ of odd characteristic. These numbers $\operatorname{hyp}(g)$ are expressed as a polynomial in $q$ with…

While the numbers of superspecial curves of genus at most 3 are well understood, and several computational approaches have been developed to count superspecial curves of genus 4 with large automorphism groups, much less is known in higher…

In this paper we study a family of curves obtained by fibre products of hyperelliptic curves. We then exploit this family to construct examples of curves of given genus g over a finite field Fq with many rational points. The results…

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…

The family of symmetric powers of an $L$-function associated with an elliptic curve with complex multiplication has received much attention from algebraic, automorphic and p-adic points of view. Here we examine one explicit such family from…

We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3),…

For a given elliptic curve $\mathbf{E}$ over a finite field of odd characteristic and a rational function $f$ on $\mathbf{E}$ we first study the linear complexity profiles of the sequences $f(nG)$, $n=1,2,\dots$ which complements earlier…

We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…

We compute the $L$-functions of a large class of algebraic curves, and verify the expected functional equation numerically. Our computations are based on our previous results on stable reduction to calculate the local $L$-factor and the…

We present an efficient algorithm to compute the Euler factor of a genus 2 curve C/Q at an odd prime p that is of bad reduction for C but of good reduction for the Jacobian of C (a prime of ``almost good'' reduction). Our approach is based…

We describe an algorithm to compute the zeta function of any non-hyperelliptic genus 3 plane curve $C$ over a finite field with automorphism group $G = \mathbb{Z} / 2 \mathbb{Z}$. This algorithm computes in the Monsky-Washnitzer cohomology…

We study theta characteristics of hyperelliptic metric graphs of genus $g$ with no bridge edges. These graphs have a harmonic morphism of degree two to a metric tree that can be lifted to morphism of degree two of a hyperelliptic curve $X$…

We present an index calculus algorithm with double large prime variation which lends itself well to a rigorous analysis. Using this algorithm we prove that for fixed genus $g \geq 2$, the discrete logarithm problem in degree 0 class groups…

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…

A new approach has been recently developed to study the arithmetic of hyperelliptic curves $y^2=f(x)$ over local fields of odd residue characteristic via combinatorial data associated to the roots of $f$. Since its introduction, numerous…

We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.

This paper determines the normal forms of hyperelliptic supersingular curves of genus g over an algebraically closed field F of characteristic 2 for 0 < g< 9. We also show that every hyperelliptic supersingular curve of genus 9 over F has…

Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive…