Related papers: An inverse Jacobian algorithm for Picard curves
Given a sextic CM field $K$, we give an explicit method for finding all genus 3 hyperelliptic curves defined over $\mathbb{C}$ whose Jacobians are simple and have complex multiplication by the maximal order of this field, via an…
Up to isomorphism over C, every simple principally polarized abelian variety of dimension 3 is the Jacobian of a smooth projective curve of genus 3. Furthermore, this curve is either a hyperelliptic curve or a plane quartic. Given a sextic…
We propose a globally convergent computational technique for the nonlinear inverse problem of reconstructing the zero-order coefficient in a parabolic equation using partial boundary data. This technique is called the "reduced dimensional…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
We formulate a solution to the Algebraic version of the Inverse Jacobi problem. Using this solution we produce explicit addition laws on any algebraic curve generalizing the law suggested by Leykin [2] in the case of (n, s) curves. This…
Given a curve defined over an algebraically closed field which is complete with respect to a nontrivial valuation, we study its tropical Jacobian. This is done by first tropicalizing the curve, and then computing the Jacobian of the…
We present here the necessary and sufficient conditions for the invertibility of tridiagonal matrices, commonly named Jacobi matrices, and explicitly compute their inverse. The techniques we use are related with the solution of…
Let $\mathcal{C}$ be a smooth, projective, genus $g\geq 2$ curve, defined over $\mathbb{C}$. Then $\mathcal{C}$ has \emph{many automorphisms} if its corresponding moduli point $p \in \mathcal{M}_g$ has a neighborhood $U$ in the complex…
A set of multi-homogeneous equations for the Jacobian of a genus two curve is given. The approach used is to write down affine equations for the Jacobian minus various tranlations of the Theta-divisor by [2]-division points, and then to…
In this paper we propose a method of solving the Jacobi inversion problem in terms of multiply periodic $\wp$ functions, also called Kleinian $\wp$ functions. This result is based on the recently developed theory of multivariable sigma…
Multi-wave inverse problems are indirect imaging methods using the interaction of two different imaging modalities. One brings spatial accuracy, and the other contrast sensitivity. The inversion method typically involve two steps. The first…
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…
Inspired by methods of N. P. Smart, we describe an algorithm to determine all Picard curves over Q with good reduction away from 3, up to Q-isomorphism. A correspondence between the isomorphism classes of such curves and certain quintic…
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…
Let $m\geq3$ be an integer. We show that every torsor of the Jacobian of the universal family of degree-$m$ Fermat curve is necessarily a connected component of the Picard scheme. We show that the Jacobian of the generic degree-$m$ Fermat…
We use methods for computing Picard numbers of reductions of K3 surfaces in order to study the decomposability of Jacobians over number fields and the variance of Mordell-Weil ranks of families of Jacobians over different ground fields. For…
We develop a method to compute the Ekedahl-Oort type of a curve C over a field k of characteristic p (which is the isomorphism type of the p-kernel group scheme J[p], where J is the Jacobian of C). Part of our method is general, in that we…
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…
We study an inverse initial-density problem for a nonlinear diffusive coagulation--fragmentation equation with known coagulation and fragmentation kernels. The objective is to recover the unknown initial particle-size distribution on a…
We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…