Related papers: A Generic Approach to Searching for Jacobians
The "defect" of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre bound for the curve. We present a construction for producing genus-4 double covers of genus-2 curves over…
In this work we propose an algorithm that numerically evaluates Kleinian hyperelliptic functions associated with a complex curve of genus 2. This algorithm is based upon constructing a sequence of curves with Richelot isogenous Jacobians…
We consider the distribution of normalized Frobenius traces for two families of genus 3 hyperelliptic curves over Q that have large automorphism groups: y^2=x^8+c and y^2=x^7-cx with c in Q*. We give efficient algorithms to compute the…
We study degree 2 and 4 elliptic subcovers of hyperelliptic curves of genus 3 defined over $\mathbb C$. The family of genus 3 hyperelliptic curves which have a degree 2 cover to an elliptic curve $E$ and degree 4 covers to elliptic curves…
In this paper, we propose an improved algorithm for computing mod $\ell$ Galois representations associated to eigenforms of arbitrary levels prime to $\ell$. Precisely, we present a method to find the Jacobians of modular curves which have…
We present an algorithm solving the following problem: given two genus 2 curves over a field k with isogenous Jacobians, compute such an isogeny explicitly. This isogeny can be either an l-isogeny or, in the real multiplication case, an…
A quantum computer encodes information in quantum states and runs quantum algorithms to surpass the classical counterparts by exploiting quantum superposition and quantum correlation. Grover's quantum search algorithm is a typical quantum…
In this article, we present a method for computing rational points on hyperelliptic curves of genus~3 and isolated quadratic points on hyperelliptic curves of genus~2 and~3 whose Jacobians have rank~0. Our approach begins by computing the…
We construct natural relative compactifications for the relative Jacobian over a family $X/S$ of reduced curves. In contrast with all the available compactifications so far, ours admit a universal sheaf, after an etale base change. Our…
Suppose $Y$ is a smooth variety equipped with a top form. We prove a simple theorem giving a sharp lower bound on the geometric genus of a family of subvarieties of $Y$, in terms of the dimension of this family. Two elementary applications…
If $E$ is an elliptic curve, defined over $\mathbb{Q}$ or a number field having at least one real embedding, then Elkies proved that $E$ has supersingular reduction at infinitely many primes $p$. Baba and Granath extended this result to…
Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries…
We present a new technique to study Jacobian variety decompositions using subgroups of the automorphism group of the curve and the corresponding intermediate covers. In particular, this new method allows us to produce many new examples of…
Let C/Q be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of Q, but may not have a hyperelliptic model of the usual form over Q. We describe an algorithm that…
We study the problem of determining the minimal genus of a simple finite connected graph. We present an algorithm which, for an arbitrary graph $G$ with $n$ vertices and $m$ edges, determines the orientable genus of $G$ in…
Prime factorization has been a buzzing topic in the field of number theory since time unknown. However, in recent years, alternative avenues to tackle this problem are being explored by researchers because of its direct application in the…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
The Quantum Approximate Optimization Algorithm can naturally be applied to combinatorial search problems on graphs. The quantum circuit has p applications of a unitary operator that respects the locality of the graph. On a graph with…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
We give an algorithm to compute $(\ell,\ell,\ell)$-isogenies from the Jacobians of genus three hyperelliptic curves to the Jacobians of non-hyperelliptic curves. An important application is to reduce the discrete logarithm problem in the…