Related papers: Efficient Point-Counting Algorithms for Superellip…

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

We introduce an algorithm to compute the rational torsion subgroup of the Jacobian of a hyperelliptic curve of genus 3 over the rationals. We apply a Magma implementation of our algorithm to a database of curves with low discriminant due to…

We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…

We present a Kedlaya-style point counting algorithm for cyclic covers $y^r = f(x)$ over a finite field $\mathbb{F}_{p^n}$ with $p$ not dividing $r$, and $r$ and $\deg{f}$ not necessarily coprime. This algorithm generalizes the…

We present a new quadratic Chabauty method to compute the integral points on certain even degree hyperelliptic curves. Our approach relies on a nontrivial degree zero divisor supported at the two points at infinity to restrict the $p$-adic…

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…

Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm…

In algebraic geometry, superspecial curves are important research objects. While the number of superspecial genus-3 curves in characteristic $p$ is known, the number of hyperelliptic ones among them has not been determined even for small…

The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…

The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials (written as sums of monomials). We give recurrence formulae…

We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.

We prove formulas for power moments for point counts of elliptic curves over a finite field $k$ such that the groups of $k$-points of the curves contain a chosen subgroup. These formulas express the moments in terms of traces of Hecke…

In the previous paper, Hirakawa and the author determined the set of rational points of a certain infinite family of hyperelliptic curves $C^{(p;i,j)}$ parametrized by a prime number $p$ and integers $i$, $j$. In the proof, we used the…

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

We find a closed formula for the number $\operatorname{hyp}(g)$ of hyperelliptic curves of genus $g$ over a finite field $k=\mathbb{F}_q$ of odd characteristic. These numbers $\operatorname{hyp}(g)$ are expressed as a polynomial in $q$ with…

We introduce tensor network contraction algorithms for counting satisfying assignments of constraint satisfaction problems (#CSPs). We represent each arbitrary #CSP formula as a tensor network, whose full contraction yields the number of…

In some cases, computational benefit can be gained by exploring the hyper parameter space using a deterministic set of grid points instead of a Markov chain. We view this as a numerical integration problem and make three unique…

The Thue-Siegel method is used to obtain an upper bound for the number of primitive integral solutions to a family of quartic Thue's inequalities. This will provide an upper bound for the number of integer points on a family of elliptic…

We study the problem of efficiently constructing a curve C of genus 2 over a finite field F for which either the curve C itself or its Jacobian has a prescribed number N of F-rational points. In the case of the Jacobian, we show that any…