Related papers: A Generic Approach to Searching for Jacobians
We exhibit the isogeny classes of supersingular abelian threefolds over F_{2^n} containing the Jacobian of a genus 3 curve. In particular, we prove that for even n>6 there always exist a maximal and a minimal curve over F_{2^n}. All the…
We use recently developed algorithms and a new database of modular curves constructed for the L-functions and Modular Forms Database to enumerate completely decomposable modular Jacobians of level N < 240. In particular, we find examples in…
We present a compact quantum circuit for factoring a large class of integers, including some whose classical hardness is expected to be equivalent to RSA (but not including RSA integers themselves). Most notably, we factor $n$-bit integers…
We show that a genus $2$ curve over a number field whose jacobian has complex multiplication will usually have stable bad reduction at some prime. We prove this by computing the Faltings height of the jacobian in two different ways. First,…
We describe a method for computing the Cassels-Tate pairing on the 2-Selmer group of the Jacobian of a genus 2 curve. This can be used to improve the upper bound coming from 2-descent for the rank of the group of rational points on the…
Variational inequalities represent a broad class of problems, including minimization and min-max problems, commonly found in machine learning. Existing second-order and high-order methods for variational inequalities require precise…
In this paper, we make specific conjectures about the distribution of Jacobians of random graphs with their canonical duality pairings. Our conjectures are based on a Cohen-Lenstra type heuristic saying that a finite abelian group with…
In arithmetic and algebraic geometry, superspecial (s.sp.\ for short) curves are one of the most important objects to be studied, with applications to cryptography and coding theory. If $g \geq 4$, it is not even known whether there exists…
We describe the use of explicit isogenies to translate instances of the Discrete Logarithm Problem (DLP) from Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, where they are vulnerable to faster…
We find equations for the higher dimensional analogue of the modular curve X_0(3) using Mumford's algebraic formalism of algebraic theta functions. As a consequence, we derive a method for the construction of genus 2 hyperelliptic curves…
We introduce a common generalization of essentially all known methods for explicit computation of Selmer groups, which are used to bound the ranks of abelian varieties over global fields. We also simplify and extend the proofs relating what…
Pedigrees, or family trees, are graphs of family relationships that are used to study inheritance. A fundamental problem in computational biology is to find, for a pedigree with $n$ individuals genotyped at every site, a set of…
Predicting the cheapest sample size for the optimal stratification in multivariate survey design is a problem in cases where the population frame is large. A solution exists that iteratively searches for the minimum sample size necessary to…
Let $C$ be a smooth projective curve of genus $g \ge 1$ over a finite field $\F$ of cardinality $q$. In this paper, we first study $\#\J_C$, the size of the Jacobian of $C$ over $\F$ in case that $\F(C)/\F(X)$ is a geometric Galois…
We study the structure of Jacobians of geometrically reduced curves over arbitrary (i. e., not necessarily perfect) fields. We show that, while such a group scheme cannot in general be decomposed into an affine and an Abelian part as over…
For a class of non-hyperelliptic genus 3 curves C which are 2-fold coverings of elliptic curves E, we give an explicit algebraic description of all birationally non-equivalent genus 2 curves whose Jacobians are degree 2 isogeneous to the…
In this article, we show that in each of four standard families of hyperelliptic curves, there is a density-$1$ subset of members with the property that their Jacobians have adelic Galois representation with image as large as possible. This…
We approach the Torelli problem of recostructing a curve from its Jacobian from a computational point of view. Following Dubrovin, we design a machinery to solve this problem effectively, which builds on methods in numerical algebraic…
In [5], without giving a detailed proof, Yamauchi provided a formula to calculate the genus of a certain family of smooth complete intersection algebraic curves. That formula is used extensively in [1] to study the algebraic curves for…
We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…