English

An inverse Jacobian algorithm for Picard curves

Number Theory 2020-04-24 v2

Abstract

We study the inverse Jacobian problem for the case of Picard curves over C\mathbb{C}. More precisely, we elaborate on an algorithm that, given a small period matrix ΩC3×3\Omega\in \mathbb{C}^{3\times 3} corresponding to a principally polarized abelian threefold equipped with an automorphism of order 33, returns a Legendre-Rosenhain equation for a Picard curve with Jacobian isomorphic to the given abelian variety. Our method corrects a formula obtained by Koike-Weng in [Math. Comp., 74(249):499-518, 2005] which is based on a theorem of Siegel. As a result, we apply the algorithm to obtain (numerically) all the isomorphism classes of Picard curves with maximal complex multiplication attached to the sextic CM-fields with class number at most 44. In particular, we obtain (conjecturally) the complete list of CM Picard curves defined over Q\mathbb{Q}. In the appendix, Vincent gives a correction to the generalization of Takase's formula for the inverse Jacobian problem for hyperelliptic curves given in [Balakrishnan-Ionica-Lauter-Vincent, LMS J. Comput. Math., 19(suppl. A):283-300, 2016].

Keywords

Cite

@article{arxiv.1611.02582,
  title  = {An inverse Jacobian algorithm for Picard curves},
  author = {Joan-C. Lario and Anna Somoza and Christelle Vincent},
  journal= {arXiv preprint arXiv:1611.02582},
  year   = {2020}
}

Comments

Appendix by Christelle Vincent, 19 pages, extension and clarification of previous version

R2 v1 2026-06-22T16:45:43.575Z