12.07.2015 Views

S-integral points on hyperelliptic curves Homero Renato Gallegos ...

S-integral points on hyperelliptic curves Homero Renato Gallegos ...

S-integral points on hyperelliptic curves Homero Renato Gallegos ...

SHOW MORE
SHOW LESS
  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Chapter 3Upper bounds for the size ofS-<str<strong>on</strong>g>integral</str<strong>on</strong>g> <str<strong>on</strong>g>points</str<strong>on</strong>g> <strong>on</strong> <strong>hyperelliptic</strong><strong>curves</strong>The material presented here is a slightly expanded versi<strong>on</strong> of that in my paper [25],which is to appear in The Internati<strong>on</strong>al Journal of Number Theory.C<strong>on</strong>sider the <strong>hyperelliptic</strong> curve with affine modelC : Y 2 = a n X n + a n−1 X n−1 + · · · + a 0 , (3.0.1)where a 0 , . . . , a n are rati<strong>on</strong>al integers, a n ≠ 0, n ≥ 5, where the polynomial <strong>on</strong> theright-hand side is irreducible. Let S be a finite set of rati<strong>on</strong>al primes. A rati<strong>on</strong>al numberx = p/q, p, q ∈ Z, (p, q) = 1, is an S-integer if q is either 1 or it is divisible by primes inS <strong>on</strong>ly. The size (or height) of x, x ≠ 0 is defined by max{log|a|, log|b|}. In this chapterwe give a method for explicitly computing an upper bound for the size of the S-<str<strong>on</strong>g>integral</str<strong>on</strong>g><str<strong>on</strong>g>points</str<strong>on</strong>g> <strong>on</strong> <strong>hyperelliptic</strong> <strong>curves</strong> (3.0.1). Our strategy is based in part <strong>on</strong> the ideas in [15](see Chapter 1 for a detailed explanati<strong>on</strong> of the similarities and the differences betweenthe two approaches).We use a variant of Baker’s method to transform the problem of finding the S-18

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!