Related papers: A Generic Approach to Searching for Jacobians

Let $p$ be a prime number and let $k$ be an algebraically closed field of characteristic $p$. A $BT_1$ group scheme over $k$ is a finite commutative group scheme which arises as the kernel of $p$ on a $p$-divisible (Barsotti--Tate) group.…

We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field $\mathbb F_q$, with explicit real multiplication by an order $\mathbb Z[\eta]$ in a totally real cubic…

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…

In this work, we present an efficient method for computing in the Generalized Jacobian of special singular curves. The efficiency of the operation is due to representation of an element in the Jacobian group by a single polynomial.

Working with exhaustive search on large dataset is infeasible for several reasons. Recently, developed techniques that made pattern set mining feasible by a general solver with long execution time that supports heuristic search and are…

Consider a genus 2 curve defined over $\mathbb{Q}$ given by an affine equation of the form $y^2 = f(x)$ for some polynomial $f$ of degree 5, and let $p$ be an odd prime. Extending work of Perrin-Riou for elliptic curves, we construct a…

We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem…

We consider the problem of efficient computation in the Jacobian of a hyperelliptic curve of genus 3 defined over a field whose characteristic is not 2. For curves with a rational Weierstrass point, fast explicit formulas are well known and…

For a given hyperelliptic curve $C$ over a finite field with Jacobian $J_C$, we consider the hyperelliptic analogue of the congruential generator defined by $W_n=W_{n-1}+D$ for $n\geq 1$ and $D,W_0\in J_C$. We show that curves of genus 2…

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

We show how to efficiently compute functions on jacobian varieties and their quotients. We deduce a quasi-optimal algorithm to compute $(l,l)$ isogenies between jacobians of genus two curves.

We give an explicit weak solution to the Schottky problem, in the spirit of Riemann and Schottky. For any genus $g$, we write down a collection of polynomials in genus $g$ theta constants, such that their common zero locus contains the…

We study the family of algebraic curves of genus $\geq 1$ defined by the affine equations $y^s=ax^r+b$ over a number field $k$, where $r \geq 2$ and $s\geq 2$ are fixed integers. Assuming the strong version of Lang's conjecture on varieties…

Learning expressive probabilistic models correctly describing the data is a ubiquitous problem in machine learning. A popular approach for solving it is mapping the observations into a representation space with a simple joint distribution,…

In this work, we consider a family of sure-success quantum algorithms, which is grouped into even and odd members for solving a generalized Grover search problem. We prove the matching conditions for both groups and give the corresponding…

Let $\mathcal X$ be a genus 2 curve defined over a field $K$, $\mbox{char} K = p \geq 0$, and $\mbox{Jac} (\mathcal X, \iota)$ its Jacobian, where $\iota$ is the principal polarization of $\mbox{Jac} (\mathcal X)$ attached to $\mathcal X$.…

Following (and elaborating on) a method of Logan and van Luijk, we exhibit explicit genus-2 curves whose Jacobians have nontrivial 2-torsion in their Tate-Shafarevich groups.

We explicitly construct the algebraic model of affine Jacobian of a generic algebraic curve of high genus and use it to compute the Euler characteristic of the Jacobian and investigate its structure.

Given a polynomial $f\in\mathbb{C}[x]$, we consider the family of superelliptic curves $y^d=f(x)$ and their Jacobians $J_d$ for varying integers $d$. We show that for any integer $g$ the number of abelian varieties up to isogeny of…

Jacobi's $\theta$ function has numerous applications in mathematics and computer science; a naive algorithm allows the computation of $\theta(z,\tau)$, for $z, \tau$ verifying certain conditions, with precision $P$ in $O(\mathcal{M}(P)…