Related papers: Hunting for curves with many points

We prove that the group of rational points of a non-isotrivial elliptic curve defined over the perfect closure of a function field in one variable over a finite field is finiteley generated.

Let $k$ be a number field. We refine a construction of Mestre--Shioda to construct (infinite) families of hyperelliptic curves $X/{k}$ having a record number of rational points and record Mordell--Weil rank relative to the genus of $g$ of…

In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…

We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the…

We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

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…

We study the problem of lifting curves from finite fields to number fields in a genus and gonality preserving way. More precisely, we sketch how this can be done efficiently for curves of gonality at most four, with an in-depth treatment of…

We show that if $K$ is an arbitrary field and $G$ is a finite group then there exists a curve over $K$ with automorphism group $G$. We also give a positive solution to the weak inverse Galois problem for function fields over an arbitrary…

We develop a constructive process which determines all extreme points of the unit ball of the space of $m$--linear forms, $m\geq1.$ Our method provides a full characterization of the geometry of that space through finitely many elementary…

Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational…

In this paper we determine automorphism groups of cyclic algebraic curves defined over finite fields of any characteristic.

We present an algorithm for detecting basepoints of linear series of curves in the plane. Moreover, we give an algorithm for constructing a linear series of curves in the plane for given basepoints. The underlying method of these algorithms…

We bound the number of fixed points of an automorphism of a real curve in terms of the genus and the number of connected components of the real part of the curve. Using this bound, we derive some consequences concerning the maximum order of…

It is a well known result that the number of points over a finite field on the Legendre family of elliptic curves can be written in terms of a hypergeometric function modulo $p$. In this paper, we extend this result, due to Igusa, to a…

We present a framework for constructing examples of smooth projective curves over number fields with explicitly given elements in their second K-group using elementary algebraic geometry. This leads to new examples for hyperelliptic curves…

We describe a method that allows, under some hypotheses, to compute all the rational points of some genus 5 curves defined over a number field. This method is used to solve some arithmetic problems that remained open.

Following our joint work arXiv:1003.4578 with Robert Langlands, we make the first steps toward developing geometric methods for analyzing trace formulas in the case of the function field of a curve defined over a finite field. We also…

We present families of (hyper)elliptic curve which admit an efficient deterministic encoding function.

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends Kedlaya's algorithm to a very general class of curves using a map to the projective line. We develop all the necessary bounds,…