Related papers: Efficient Point-Counting Algorithms for Superellip…

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…

Let k be a finite field of odd characteristic. We find a closed formula for the number of k-isomorphism classes of pointed, and non-pointed, hyperelliptic curves of genus g over k, admitting a Koblitz model. These numbers are expressed as a…

In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of $p$-adic $L$-functions and have further been applied to compute rational…

We describe the automorphism groups of finite $p$-groups arising naturally via Hessian determinantal representations of elliptic curves defined over number fields. Moreover, we derive explicit formulas for the orders of these automorphism…

In this work, we present the first efficient and practical algorithm for estimating the number of triangles in a graph stream using predictions. Our algorithm combines waiting room sampling and reservoir sampling with a predictor for the…

We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…

This paper is the first version of a project of classifying all superelliptic curves of genus $g \leq 48$ according to their automorphism group. We determine the parametric equations in each family, the corresponding signature of the group,…

In algebraic geometry, enumerating or finding superspecial curves in positive characteristic $p$ is important both in theory and in computation. In this paper, we propose feasible algorithms to enumerate or find superspecial hyperelliptic…

We consider a numerical scheme for Hamilton-Jacobi equations based on a direct discretization of the Lax-Oleinik semi-group. We prove that this method is convergent with respect to the time and space stepsizes provided the solution is…

We describe an algorithm to compute the local Coleman-Gross p-adic height at p on a hyperelliptic curve. Previously, this was only possible using an algorithm due to Balakrishnan and Besser, which was limited to odd degree. While we follow…

In this note we combine the advantages of the methods of Siegel-Baker-Coates and of Lang-Zagier for the computation of S-integral points on elliptic curves in Weierstrass normal form over the rationals. In this way we are able to overcome…

Knot theory is an active field of mathematics, in which combinatorial and computational methods play an important role. One side of computational knot theory, that has gained interest in recent years, both for complexity analysis and…

We investigate the possibility to extract Seiberg-Witten curves from the formal series for the prepotential, which was obtained by the Nekrasov approach. A method for models whose Seiberg-Witten curves are not hyperelliptic is proposed. It…

Let $K$ be a number field and let $C/K$ be a curve of genus 2 with Jacobian variety $J$. In this paper, we study the canonical height $\hat{h} \colon J(K) \to \mathbb R$. More specifically, we consider the following two problems, which are…

We establish several surjectivity theorems regarding the Galois groups of small iterates of $\phi_c(x)=x^2+c$ for $c\in\mathbb{Q}$. To do this, we use explicit techniques from the theory of rational points on curves, including the method of…

We apply some of the latest techniques from machine-learning to the arithmetic of hyperelliptic curves. More precisely we show that, with impressive accuracy and confidence (between 99 and 100 percent precision), and in very short time…

We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…

In this paper, we give an explicit formula as well as a practical algorithm for computing the Cassels-Tate pairing on $\text{Sel}^{2}(J) \times \text{Sel}^{2}(J)$ where $J$ is the Jacobian variety of a genus two curve under the assumption…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

We describe algorithms for computing the intersection numbers of divisors and of Chern classes of the Hodge bundle on the moduli spaces of stable pointed curves. We also discuss the implementations and the results obtained. There are…