Mathematics of Computation · 2009 · 84 citations · 17 references
Natural SciencesComputer ScienceMathematicsAlgorithmsComputational GeometryGeometryAlgebraic GeometryArithmetic GeometryElliptic CurvesCovering ProblemsDescentGeometric CoversRational Curves
We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the hyperelliptic curve has no rational points. This provides a relatively efficiently tested criterion for solvability of hyperelliptic curves. We also discuss applications of this algorithm to curves of genus <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="1"> <mml:semantics> <mml:mn>1</mml:mn> <mml:annotation encoding="application/x-tex">1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and to curves with rational points.
17
The Magma Algebra System I: The User Language
Wieb Bosma, John Cannon, Catherine Playoust · Journal of Symbolic Computation · 1997 · 7.4K citations
Choice Reviews Online · 1992 · 210 citations
The Cassels-Tate Pairing on Polarized Abelian Varieties
Bjorn Poonen, Michael Stoll · Annals of Mathematics · 1999 · 179 citations · Full text
Implementing 2-descent for Jacobians of hyperelliptic curves
Michael Stoll · Acta Arithmetica · 2001 · 147 citations · Full text