# Rational Points Near Curves and Small Nonzero |x3-y2| via Lattice Reduction

```@inproceedings{Elkies2000RationalPN,
title={Rational Points Near Curves and Small Nonzero |x3-y2| via Lattice Reduction},
author={Noam D. Elkies},
booktitle={ANTS},
year={2000}
}```
• N. Elkies
• Published in ANTS 14 May 2000
• Mathematics
We give a new algorithm using linear approximation and lattice reduction to efficiently calculate all rational points of small height near a given plane curve C. For instance, when C is the Fermat cubic, we find all integer solutions of | x 3 + y 3 −z 3| < M with 0 < x ≤y < z < N in heuristic time ≪ (log O(1) N ) M provided M ≫N, using only O(log N) space. Since the number of solutions should be asymptotically proportional to M log N (as long as M < N 3), the computational costs are essentially…
76 Citations
Bounding the sum of square roots via lattice reduction
• Mathematics, Computer Science
Math. Comput.
• 2010
It is shown that this problem is closely related to the shortest vector problem in certain integral lattices and an algorithm to find lower bounds based on lattice reduction algorithms is presented, whose validation implies that the algorithm runs in polynomial time and the problem of comparing two sums of square roots of small integers can be solved in poynomial time.
Worst cases and lattice reduction
• Computer Science
Proceedings 2003 16th IEEE Symposium on Computer Arithmetic
• 2003
A new algorithm to find worst cases for correct rounding of an analytic function, and exhibits some new worst cases found using this algorithm, for double-extended and quadruple precision.
Marshall Hall's Conjecture and Gaps Between Integer Points on Mordell Elliptic Curves
For a non-square positive integer x, let k_x denote the distance between x^3 and the perfect square closest to x^3. A conjecture of Marshall Hall states that the ratios r_x = (x^(1/2))/k_x, are
Searching worst cases of a one-variable function using lattice reduction
• Computer Science
IEEE Transactions on Computers
• 2005
A new algorithm to find worst cases for the correct rounding of a mathematical function of one variable by extending Coppersmith's work on the integer small value problem - for polynomials with integer coefficients - using lattice reduction is proposed.
Correction to “Gaps in n mod 1 and ergodic Theory”
• Mathematics
• 2005
Cut the unit circle S = R/Z at the points { √ 1}, { √ 2}, . . . , { √ N }, where {x} = x mod 1, and let J1, . . . , JN denote the complementary intervals, or gaps, that remain. We show that, in
Rational points near manifolds and metric Diophantine approximation
This work is motivated by problems on simultaneous Diophantine approximation on manifolds, namely, establishing Khintchine and Jarnik type theorems for submanifolds of R^n. These problems have
Gaps in √n mod 1 and ergodic theory
• Mathematics
• 2004
Cut the unit circle S = R/Z at the points { √ 1}, { √ 2}, . . . , { √ N }, where {x} = x mod 1, and let J1, . . . , JN denote the complementary intervals, or gaps, that remain. We show that, in
Deciding Existence of Rational Points on Curves: An Experiment
• Mathematics
Exp. Math.
• 2008
This paper considers all genus-2 curves over ℚ given by an equation y 2 = f(x) with f a square-free polynomial of degree 5 or 6, and decides whether there is a rational point on the curve by a combination of techniques that are applicable to hyperelliptic curves in general.
Computing elliptic curves over ℚ via Thue-Mahler equations and related problems
An algorithm for finding all elliptic curves over Q with a given conductor and details of the output derived from running the algorithm, concentrating on the cases of conductor p or p2, for p prime, with comparisons to existing data are provided.