Related papers: Point counting on curves using a gonality preservi…

We introduce a notion of good cohomology for multiple lines in $\mathbb{P}^3$ and we classify multiple lines with good cohomology up to multiplicity 4. In particular, we show that the family of space curves of degree d, not lying on a…

To count bundles on curves, we study zetas of elliptic curves and their zeros. There are two types, i.e., the pure non-abelian zetas defined using moduli spaces of semi-stable bundles, and the group zetas defined for special linear groups.…

We present a new method for computing the zeta function of an algebraic curve over a finite field. The algorithm relies on a trace formula of Harvey to count points on a plane model of the curve. The zeta function of the curve is then…

Curves over finite fields are of great importance in cryptography and coding theory. Through studying their zeta-functions, we would be able to find out vital arithmetic and geometric information about them and their Jacobians, including…

The geometry of algebraic curves over finite fields is a rich area of research. In previous work, the authors investigated a particular aspect of the geometry over finite fields of the classical unit circle, namely how the number of…

In this survey, we discuss the problem of the maximum number of points of curves of genus 1,2 and 3 over finite fields

In the framework of the Hough transform technique to detect curves in images, we provide a bound for the number of Hough transforms to be considered for a successful optimization of the accumulator function in the recognition algorithm.…

Using class field theory one associates to each curve C over a finite field, and each subgroup G of its divisor class group, unramified abelian covers of C whose genus is determined by the index of G. By listing class groups of curves of…

Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…

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…

We construct curves with many points over finite fields using the class group

Let $\gamma_0$ be a curve on a surface $\Sigma$ of genus $g$ and with $r$ boundary components and let $\pi_1(\Sigma)\curvearrowright X$ be a discrete and cocompact action on some metric space. We study the asymptotic behavior of the number…

In this paper we present a p-adic algorithm to compute the zeta function of a nondegenerate curve over a finite field using Monsky-Washnitzer cohomology. The paper vastly generalizes previous work since all known cases, e.g. hyperelliptic,…

We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing…

In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…

We show that a general plane curve of degree at least 4 is uniquely determined by the full set of its bitangent lines. This problem has an elementary solution for degree at least 5, and the paper is almost entirely devoted to curves of…

Given an integer $\gamma\geq 2$ and an odd prime power $q$ we show that for every large genus $g$ there exists a non-singular curve $C$ defined over $\mathbb{F}_q$ of genus $g$ and gonality $\gamma$ and with exactly $\gamma(q+1)$…

We describe an algorithm to count the number of rational points of an hyperelliptic curve defined over a finite field of odd characteristic which is based upon the computation of the action of the Frobenius morphism on a basis of the…

In this work, we investigate hyperelliptic curves of type $C: y^2 = x^{2g+1} + ax^{g+1} + bx$ over the finite field $\mathbb{F}_q, q = p^n, p > 2$. For the case of $g = 3$ and $4$ we propose algorithms to compute the number of points on the…

In this paper we describe a generalisation and adaptation of Kedlaya's algorithm for computing the zeta function of a hyperelliptic curve over a finite field of odd characteristic that the author used for the implementation of the algorithm…