Related papers: Counting points on curves using a map to P^1

The zeta function of a motive over a finite field is multiplicative with respect to the direct sum of motives. It has beautiful analytic properties, as were predicted by the Weil conjectures. There is also a multiplicative zeta function,…

In this manuscript, we give effective methods for computing the zeta function of maximal orders on surfaces.

Let C in C_1xC_2 be a curve of type (d_1,d_2) in the product of the two curves C_1 and C_2. Let d be a positive integer. We prove that if a certain inequality involving d_1, d_2, d, and the genera of the curves C_1, C_2, and C is satisfied,…

We report on our project to find explicit examples of $K3$ surfaces having real or complex multiplication. Our strategy is to search through the arithmetic consequences of RM and CM. In order to do this, an efficient method is needed for…

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…

Using toric modifications and some compatibility we compute the local $p$-adic zeta function of a plane curve singularity. Thanks to the compatibility, we can work over the analytic change of variables formula for $p$-adic integrals, hence…

Consider a smooth projective curve $\overline{C}$ over a finite field $\mathbb{F}_q$, equipped with a simply branched morphism $\overline{C} \to \mathbb{P}^1$ of degree $d \leq 5$. Assume char$\, \mathbb{F}_q > 2$ if $d \leq 4$, and char$\,…

In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…

We exhibit an algorithm that, given input a curve $X$ over a number field, computes as output the minimal degree of a Belyi map $X \to \mathbb{P}^1$.

We show that the motivic zeta functions of smooth, geometrically connected curves with no rational points are rational functions. This was previously known only for curves whose smooth projective models have a rational point on each…

By considering mirror symmetry applied to conformal field theories corresponding to strings propagating in quintic hypersurfaces in projective 4-space, Candelas, de la Ossa, Green and Parkes calculated the ``number of rational curves on the…

We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…

The paper describes a method for calculating values of Riemann's Zeta function within the critical strip 0< {\sigma} <1 and on its boundary. The approach is based on the "Alternating Zeta function" {\eta}(s). The actual Riemann Zeta…

In this paper we obtain an explicit formula for the number of degree d curves in two dimensional complex projective space, passing through (d(d+3)/2 -k) generic points and having a codimension k singularity, where k is at most 7. In the…

We propose a new approach to the value distribution theory of entire holomorphic curves. We define a ``packing density'' of an entire holomorphic curve, and show that it has various non-trivial properties. We prove a ``gap theorem'' for…

We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…

We assign an arbitrary density matrix to a weighted graph and associate to it a graph zeta function that is both a generalization of the Ihara zeta function and a special case of the edge zeta function. We show that a recently developed…

In this paper, we develop a systematic approach to enumerate curves with a certain number of nodes and one further singularity which maybe more degenerate. As a result, we obtain an explicit formula for the number of curves in a…