TWO-COVER DESCENT ON HYPERELLIPTIC CURVES

被引：47

作者：

Bruin, Nils ^{[1
]}

Stoll, Michael ^{[2
]}

机构：

[1] Simon Fraser Univ, Dept Math, Burnaby, BC V5A 1S6, Canada

[2] Univ Bayreuth, Math Inst, D-95440 Bayreuth, Germany

来源：

MATHEMATICS OF COMPUTATION | 2009年 / 78卷 / 268期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Local-global obstruction; rational points; hyperelliptic curves; descent; RATIONAL-POINTS; ALGEBRAIC-CURVES; JACOBIANS; CHABAUTY;

D O I：

10.1090/S0025-5718-09-02255-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 I and to curves with rational points.

引用

页码：2347 / 2370

页数：24

共 26 条

[1]

[Anonymous], 1986, GRADUATE TEXTS MATH

[2]

[Anonymous], 1991, LONDON MATH SOC STUD, DOI DOI 10.1017/CBO9781139172530

[3] The Magma algebra system .1. The user language [J].

Bosma, W ;

Cannon, J ;

Playoust, C .

JOURNAL OF SYMBOLIC COMPUTATION, 1997, 24 (3-4) :235-265

[4] Towers of 2-covers of hyperelliptic curves [J].

Bruin, N ;

Flynn, EV .

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2005, 357 (11) :4329-4347

[5]

Bruin N, 2002, LECT NOTES COMPUT SC, V2369, P172

[6]

Bruin N, 2003, J REINE ANGEW MATH, V562, P27

[7]

Bruin N., 2002, CWI TRACT, V133

[8]

BRUIN N, 2008, ELECT RESOURCES

[9]

BRUIN N, MORDELLWEIL SI UNPUB

[10]

Bruin N, 2006, ALGORITHM COMP MATH, V19, P63

← 1 2 3 →