2018
DOI: 10.1016/j.jnt.2017.12.001
|View full text |Cite
|
Sign up to set email alerts
|

Counting rational points on smooth cubic curves

Abstract: We use a global version of Heath-Brown's p−adic determinant method developed by Salberger to give upper bounds for the number of rational points of height at most B on non-singular cubic curves defined over Q. The bounds are uniform in the sense that they only depend on the rank of the corresponding Jacobian.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…Let Y be a subvariety of P 3 × P 3 , D ⊂ Y be an effective divisor and L be the restriction to Y of the line bundle O P 3 ×P 3 (a, b). There is then a short exact sequence 0 → L(−D) → L → L| D → 0 (15) of sheaves on Y . From the long exact cohomology sequence associated to (15), it follows that if the cohomology group H 1 (Y, L(−D)) vanishes, then the restriction of global sections…”
Section: Proof Of Lemma 23mentioning
confidence: 99%
See 1 more Smart Citation
“…Let Y be a subvariety of P 3 × P 3 , D ⊂ Y be an effective divisor and L be the restriction to Y of the line bundle O P 3 ×P 3 (a, b). There is then a short exact sequence 0 → L(−D) → L → L| D → 0 (15) of sheaves on Y . From the long exact cohomology sequence associated to (15), it follows that if the cohomology group H 1 (Y, L(−D)) vanishes, then the restriction of global sections…”
Section: Proof Of Lemma 23mentioning
confidence: 99%
“…The proof follows the same strategy as in the paper [7] on non-singular cubic curves where the authors combine Heath-Brown's p-adic determinant method in [6] with descent theory. But we will follow the approach in [15] and replace the p-adic determinant method by Salberger's global determinant method [13]. Taking m = 1 + [ √ log B] we immediately obtain the following result.…”
Section: Introductionmentioning
confidence: 99%