Papers › Doubly isogenous curves of genus two with a rational action of D₆
Doubly isogenous curves of genus two with a rational action of D₆
Jeremy Booher, Everett W. Howe, Andrew V. Sutherland, José Felipe Voloch
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Let C and C′ be curves over a finite field K, provided with embeddings ι and ι′ into their Jacobian varieties. Let D→C and D′→C′ be the pullbacks (via these embeddings) of the multiplication-by-$2$ maps on the Jacobians. We say that (C,ι) and (C′,ι′) are \emph{doubly isogenous} if Jac(C) and Jac(C′) are isogenous over K and Jac(D) and Jac(D′) are isogenous over~K. When we restrict attention to the case where C and C′ are curves of genus $2$ whose groups of K-rational automorphisms are isomorphic to the dihedral group D₆ of order $12$, we find many more doubly isogenous pairs than one would expect from reasonable heuristics. Our analysis of this overabundance of doubly isogenous curves over finite fields leads to the construction of a pair of doubly isogenous curves over a number field. That such a global example exists seems extremely surprising. We show that the Zilber--Pink conjecture implies that there can only be finitely many such examples. When we exclude reductions of this pair of global curves in our counts, we find that the data for the remaining curves is consistent with our original heuristic. Computationally, we find that doubly isogenous curves in our family of D₆ curves can be distinguished from one another by considering the isogeny classes of the Prym varieties of certain unramified covers of exponent $3$ and $4$. We discuss how our family of curves can be potentially be used to obtain a deterministic polynomial-time algorithm to factor univariate polynomials over finite fields via an argument of Kayal and Poonen.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections