Related papers: A Generic Approach to Searching for Jacobians

We find explicit equations for two-coverings of Jacobians of genus two curves over an arbitrary ground field of characteristic different from two.

Let ell be a prime, and H a curve of genus 2 over a field k of characteristic not 2 or ell. If S is a maximal Weil-isotropic subgroup of Jac(H)[ell], then Jac(H)/S is isomorphic to the Jacobian of some (possibly reducible) curve X. We…

We study the problem of approximating the number of $k$-cliques in a graph when given query access to the graph. We consider the standard query model for general graphs via (1) degree queries, (2) neighbor queries and (3) pair queries. Let…

We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…

An algorithm is developed for finding a close to optimal junction tree of a given graph G. The algorithm has a worst case complexity O(c^k n^a) where a and c are constants, n is the number of vertices, and k is the size of the largest…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

We give equations for 13 genus-2 curves over $\overline{\mathbb{Q}}$, with models over $\mathbb{Q}$, whose unpolarized Jacobians are isomorphic to the square of an elliptic curve with complex multiplication by a maximal order. If the…

We construct Weil numbers corresponding to genus-2 curves with $p$-rank 1 over the finite field $\F_{p^2}$ of $p^2$ elements. The corresponding curves can be constructed using explicit CM constructions. In one of our algorithms, the group…

In this article we give the details of an effective point counting algorithm for genus two curves over finite fields of characteristic three. The algorithm has an application in the context of curve based cryptography. One distinguished…

We study the Jacobian $J$ of the smooth projective curve $C$ of genus $r-1$ with affine model $y^r = x^{r-1}(x + 1)(x + t)$ over the function field $\mathbb{F}_p(t)$, when $p$ is prime and $r\ge 2$ is an integer prime to $p$. When $q$ is a…

We develop a cohomological description of various explicit descents in terms of generalized Jacobians, generalizing the known description for hyperelliptic curves. Specifically, given an integer $n$ dividing the degree of some reduced…

With the advancement of quantum computing, symmetric cryptography faces new challenges from quantum attacks. These attacks are typically classified into two models: Q1 (classical queries) and Q2 (quantum superposition queries). In this…

In this paper we generalize results of P. Le Duff to genus n hyperelliptic curves. More precisely, let C/Q be a hyperelliptic genus n curve and let J(C) be the associated Jacobian variety. Assume that there exists a prime p such that J(C)…

We establish the existence of hyperelliptic curves of genus $g\ge 2$ defined over $\mathbb{Q}$ whose Jacobians possess rational torsion points of order $N$ where $N=4g^2+2g-2$ or $4g^2+ 2g -4$. For $N=2g^2+7g+1$, we introduce a…

We construct explicit families of hyperelliptic curves over $\QQ$ whose Jacobians admit complex multiplication (CM). Each curve in these families is defined by \[ v^2 = (u+2)\,\varphi_d(u), \quad d = 2^e \text{ or } d=p \geq 3 \text{…

Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…

We analyze complex multiplication for Jacobians of curves of genus 3, as well as the resulting Shimura class groups and their subgroups corresponding to Galois conjugation over the reflex field. We combine our results with numerical methods…

We study the universal family of odd hyperelliptic curves of genus $g \geq 1$ over $\mathbb{Q}$. We relate the heights of $\mathbb{Q}$-points of Jacobians of curves in this family to the reduction theory of the representation of…

We study the Jacobian scheme of a plane algebraic curve at an ordinary singularity, characterizing it through a geometric property. We compute the Tjurina number for a family of curves at an ordinary singularity showing that it reaches the…

We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…