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

We show that the linear dependence on $p$ of the running time of Kedlaya's point-counting algorithm in characteristic $p$ may be reduced to $p^{1/2}$.

Let $p\ge5$ be a prime and $T$ a Kodaira type of the special fiber of an elliptic curve. We estimate the number of elliptic curves over $\mathbb Q$ up to height $X$ with Kodaira type $T$ at $p$. This enables us find the proportion of…

Study of the level curve for the real part of $\eta(s)=0$ with $\eta(s)=\pi^{-s/2}\Gamma(s/2)\zeta^\prime(s)$ gives a new classification of the zeros of $\zeta(s)$ and of $\zeta^\prime(s)$. We conjecture that for type 2 zeros, $\liminf…

In this paper, we give two algorithms to compute preimages of curves under polynomial endomorphisms. In particular, this gives an efficient way of computing preimages of points. Furthermore, we explain the abstract setting under which one…

In this note we outline a way of computing the expected lenght of the Terracini scheme of a curve, when this scheme is expected to be finite and we give a closed formula for curves in $\p^4$. We also discuss the widely open case of…

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 paper, we first summarize the existing algorithms for computing all the generalized asymptotes of a plane algebraic curve implicitly or parametrically defined. From these previous results, we derive a method that allows to easily…

This work develops an analytic framework for the study of the $\zeta$-function associated with general sequences of complex numbers. We show that a contour integral representation, commonly used when studying spectral $\zeta$-functions…

This article deals with applications of Voronin's universality theorem for the Riemann zeta-function $\zeta$. Among other results we prove that every plane smooth curve appears up to a small error in the curve generated by the values…

We compute the number of points over finite fields of some algebraic varieties related to cluster algebras of finite type. More precisely, these varieties are the fibers of the projection map from the cluster variety to the affine space of…

We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…

We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…

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…

A method to regularize and renormalize the fluctuations of a quantum field in a curved background in the $\zeta$-function approach is presented. The method produces finite quantities directly and finite scale-parametrized counterterms at…

This article is a short introduction to the theory of the groups of points of elliptic curves over finite fields. It is concerned with the elementary theory and practice of elliptic curves cryptography, the new generation of public key…

We present an algorithm that, for every fixed genus $g$, will enumerate all hyperelliptic curves of genus $g$ over a finite field $k$ of odd characteristic in quasilinear time; that is, the time required for the algorithm is…

We survey methods to compute three-point branched covers of the projective line, also known as Belyi maps. These methods include a direct approach, involving the solution of a system of polynomial equations, as well as complex analytic…

We propose to visualize complex (meromorphic) functions $f$ by their phase $P_f:=f/|f|$. Color--coding the points on the unit circle converts the function $P_f$ to an image (the phase plot of $f$), which represents the function directly on…

In this paper we use operation of crossbreeding on the set of six transmutations of corresponding asymptotic complete hybrid formulas from our previous paper. We obtain in result the set of fifteen exact meta-functional equations. Every of…

We compute the $\delta$-invariant of a curve singularity parameterized by generic sparse polynomials. We apply this to describe topological types of generic singularities of sparse resultants and ``algebraic knot diagrams'' (i.e. generic…