Related papers: A CRT algorithm for constructing genus 2 curves ov…

We extend the work of Cremona, Fisher and Stoll on minimising genus one curves of degrees 2,3,4,5, to some of the other representations associated to genus one curves, as studied by Bhargava and Ho. Specifically we describe algorithms for…

Higher genus modular invariance of two-dimensional conformal field theories (CFTs) is a largely unexplored area. In this paper, we derive explicit expressions for the higher genus partition functions of a specific class of CFTs: code CFTs,…

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…

This paper provides an algorithm enumerating superspecial trigonal curves of genus $5$ over finite fields. Executing the algorithm over a computer algebra system Magma, we enumerate them over finite fields $\mathbb{F}_{p^a}$ for any natural…

In this paper, we propose an algorithm to enumerate genus-4 superspecial hyperelliptic curves whose automorphism groups isomorphic to the quaternion group. By implementing this algorithm with Magma, we successfully obtain the number of…

I provide methods of constructing elliptic and hyperelliptic curves over global fields with interesting rational points over the given fields or over large field extensions. I also provide a elliptic curves defined over any given number…

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,…

We compute the class of arithmetic genus two Teichmueller curves in the Picard group of pseudo-Hilbert modular surfaces, distinguished according to their torsion order and spin invariant. As an application, we compute the number of genus…

We describe a method for computing the Cassels-Tate pairing on the 2-Selmer group of the Jacobian of a genus 2 curve. This can be used to improve the upper bound coming from 2-descent for the rank of the group of rational points on the…

The aim of this work is to develop a systematic manner to close overdetermined systems arising from conformal Killing tensors (CKT). The research performs this action for 1-tensor and 2-tensors. This research makes it possible to develop a…

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…

This paper explores the ability of the Chinese Remainder Theorem formalism to model Montgomery-type algorithms. A derivation of CRT based on Qin's Identity gives Montgomery reduction algorithm immediately. This establishes a unified…

We describe how the quadratic Chabauty method may be applied to explicitly determine the set of rational points on modular curves of genus $g>1$ whose Jacobians have Mordell--Weil rank $g$. This extends our previous work on the split Cartan…

Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isogeny is believed to be computationally difficult. The fastest…

There is a well known theorem by Deuring which gives a criterion for when the reduction of an elliptic curve with complex multiplication (CM) by the ring of integers of an imaginary quadratic field has ordinary or supersingular reduction.…

We determine what isogeny classes of supersingular abelian surfaces over a finite field k of characteristic 2 contain jacobians. We deal with this problem in a direct way by computing explicitly the zeta function of all supersingular curves…

We generalize the group law of curves of degree three by chords and tangents to the Jacobi variety of a hyperelliptic curve. In the case of genus 2 we accomplish the construction by a cubic parabola. We derive explicit rational formulas for…

Elliptic curves over finite fields GF(2^n) play a prominent role in modern cryptography. Published quantum algorithms dealing with such curves build on a short Weierstrass form in combination with affine or projective coordinates. In this…

The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…

We extend the explicit quadratic Chabauty methods developed in previous work by the first two authors to the case of non-hyperelliptic curves. This results in an algorithm to compute the rational points on a curve of genus $g \ge 2$ over…