hide
Free keywords:
-
Abstract:
In this interesting note the author studies two aspects of the topic suggested by his title. \\par (i) Given an elliptic curve E over \\bbfQ, how can one efficiently search for integral points ? \\par (ii) How can one construct elliptic curves (over \\bbfQ) which possess a large integral point ? \\par Let E be given in Weierstrass form y\\sp 2=x\\sp 3+ax+b with a,b\\in \\bbfZ. The author gives three answers to question (i), each of which requires O(log log H) steps to search for integral solutions with \\vert x\\vert, \\vert y\\vert ≤ H. All three depend ultimately on using continued fraction or related algorithms to find approximations of the form α r-β s\\approx 0 or α r-β s\\approx γ with r,s\\in \\bbfZ, where α,β, and γ are fixed real numbers. The first method requires that x\\sp 3+ax+b factors completely over \\bbfQ, and uses this factorization in a well-known fashion to reduce the problem to certain Pellian equations, and thence to the above continued fraction equations. The second method requires knowing a basis for the group of rational points E(\\bbfQ), and uses a combination of canonical heights and Pellian equations. It is superceded by the third method, which also requires knowledge of E(\\bbfQ). This method uses the elliptic logarithm φ : E(\\bbfR)\\sp 0→ \\bbfR/ \\bbfZ, given by the usual incomplete elliptic integral, to reduce directly to a continued fraction equation. \\par For example, suppose E(\\bbfQ) has rank one, generated by P and torsion. Then the author shows that there is an effectively computable constant c so that any integral point has the form rP+T for some T\\in E(\\bbfQ)\\sbtor s and integers r and s satisfying r⋅ 2φ (P)-s=O(e\\sp-cr\\sp 2/2). This last equation can be rapidly solved to high accuracy once one knows φ (P). The author gives a new, extremely clever way of computing φ (P) which takes O(log B) steps to produce B digits of accuracy. Although older algorithms work in O(log log B) steps the author's method has the advantage that it only requires elementary arithmetic operations. As an example, the author studies integral points on the curve y\\sp 2=x\\sp 3-30x+133. Using 50 digits of φ (P), he finds all integral points under about 10\\sp10\\sp50, including the "large" point (5143326,\\quad 11664498677). Finally he notes that the bounds obtainable from his method are barely in the range of the best known upper bounds arising from linear forms in logarithms. Thus if E(\\bbfQ) has small coefficients and small rank, then one might actually be able to prove that the set of integral points produced by the search is complete. \\par The author approaches his second topic, the production of curves with large integral points, in a more ad hoc fashion. He starts by defining a measure of impressiveness of an integral point P=(x,y) on E by the formula ρ =\\log \\vert x\\vert /\\log (\\max \\vert a\\vert\\sp1/2, \\vert b\\vert\\sp1/3). On probabilistic grounds, he suggests that for any ε gt;0 there should be only finitely many examples having ρ gt;10+ε. (This bound was also proposed by S. Lang and H. Stark.) A computer search found a number of examples with ρ in the 9 to 12 range; and the author produces two 1-parameter families with ρ→ 9. Recently, \\it P. Vojta [Diophantine approximations and value distribution theory (Lect. Notes Math. 1239), Ch. 5, Sect. 5 (1987; Zbl 0609.14011)] has shown that his general conjecture on diophantine approximations implies the author's conjecture except possibly for a finite number of 1-parameter families. \\it N. Elkies (letter to D. Zagier, 26/2/87) has found such an exceptional family (of the form y\\sp 2=x\\sp 3+132x+b(t)) satisfying ρ→ 12.
