Related papers: Counting points on genus-3 hyperelliptic curves wi…
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 give an algebraic method to compute the fourth power of the quotient of any even theta constants associated to a given non-hyperelliptic curve in terms of geometry of the curve. In order to apply the method, we work out non-hyperelliptic…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
We compute the class of the closure of the locus of hyperelliptic curves in the moduli space of stable genus-3 curves in terms of the tautological class $\lambda$ and the boundary classes $\delta_0$ and $\delta_1$. The expression of this…
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…
In arithmetic and algebraic geometry, superspecial (s.sp.\ for short) curves are one of the most important objects to be studied, with applications to cryptography and coding theory. If $g \geq 4$, it is not even known whether there exists…
The author has previously extended the theory of regular and irregular primes to the setting of arbitrary totally real number fields. It has been conjectured that the Bernoulli numbers, or alternatively the values of the Riemann zeta…
Explicit models of families of genus 2 curves with multiplication by $\sqrt D$ are known for $D= 2, 3, 5$. We obtain generic models for genus 2 curves over $\mathbb Q$ with real multiplication in 12 new cases, including all fundamental…
The "defect" of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre bound for the curve. We present a construction for producing genus-4 double covers of genus-2 curves over…
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…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
In algebraic geometry, it is important to provide effective parametrizations for families of curves, both in theory and in practice. In this paper, we present such an effective parametrization for the moduli of genus-$5$ curves that are…
In this paper, we propose an algorithm to enumerate genus-4 superspecial hyperelliptic curves whose automorphism groups isomorphic to the quaternion group. By implementing this algorithm with Magma, we successfully obtain the number of…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
In 1922, Mordell conjectured that the set of rational points on a smooth curve $C$ over $\mathbb{Q}$ with genus $g \ge 2$ is finite. This has been proved by Faltings in 1983. However, Coleman determined in 1985 an upper bound of…
We generalize Elkies's method, an essential ingredient in the SEA algorithm to count points on elliptic curves over finite fields of large characteristic, to the setting of p.p. abelian surfaces. Under reasonable assumptions related to the…
I give a formula for the zeta function of a projective toric hypersurface over a finite field and estimate its Newton polygon. As an application this formula allows us to compute the exact number of rational points on the families of…
We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…
Using the cohomology theory of Dwork, as developed by Adolphson and Sperber, we exhibit a deterministic algorithm to compute the zeta function of a nondegenerate hypersurface defined over a finite field. This algorithm is particularly…
In this paper, new probability estimates are derived for ideal lattice codes from totally real number fields using ideal class Dedekind zeta functions. In contrast to previous work on the subject, it is not assumed that the ideal in…