Related papers: Fast point counting on genus two curves in charact…
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 present three quantum algorithms for clustering graphs based on higher-order patterns, known as motif clustering. One uses a straightforward application of Grover search, the other two make use of quantum approximate counting, and all of…
We use machine learning to study the moduli space of genus two curves, specifically focusing on detecting whether a genus two curve has $(n, n)$-split Jacobian. Based on such techniques, we observe that there are very few rational moduli…
We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius.…
In this paper, we present efficient algorithms for computing the number of points and the order of the Jacobian group of a superelliptic curve over finite fields of prime order p. Our method employs the Hasse-Weil bounds in conjunction with…
We consider families of smooth projective curves of genus 2 with a single point removed and study their integral points. We show that in many such families there is a dense set of fibres for which the integral points can be effectively…
We introduce an estimator for the curvature of curves and surfaces by using finite sample points drawn from sampling a probability distribution that has support on the curve or surface. First we give an algorithm for estimation of the…
We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…
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…
We present an efficient algorithm to compute the Euler factor of a genus 2 curve C/Q at an odd prime p that is of bad reduction for C but of good reduction for the Jacobian of C (a prime of ``almost good'' reduction). Our approach is based…
In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…
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…
In topologically-protected quantum computation, quantum gates can be carried out by adiabatically braiding two-dimensional quasiparticles, reminiscent of entangled world lines. Bonesteel et al. [Phys. Rev. Lett. 95, 140503 (2005)], as well…
This paper deals with computing topological invariants such as connected components, boundary surface genus, and homology groups. For each input data set, we have designed or implemented algorithms to calculate connected components,…
We make cohomological computations related to the moduli space of genus three curves with symplectic level two structure by means of counting points over finite fields. In particular, we determine the cohomology groups of the quartic locus…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
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 this paper we classify curves of genus two over a perfect field k of characteristic two. We find rational models of curves with a given arithmetic structure for the ramification divisor and we give necessary and sufficient conditions for…
We explain how we computed equations for all genus 4 curves defined of the field with 2 elements, up-to-isomorphism, and some of the data we obtained. We give descriptions also of nice models for genus 4 curves over characteristic 2 fields,…
The problem of constructing curves with many points over finite fields has received considerable attention in the recent years. Using the class field theory approach, we construct new examples of curves ameliorating some of the known…