ArXiv.org · 2000 · 24 citations · 5 references
ComputingComputer ScienceMathematicsAlgorithmsComputational GeometryGeometryApproximation AlgorithmsArithmetic GeometryComputational Number TheoryNumber-theoretic AlgorithmsApproximation By Rational PointsCounting Rational PointsLattice ReductionLinear ApproximationLinear Function ApproximationRational Function Approximation
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|>N, using only O(log N) space. Since the number of solutions should be asymptotically proportional to M log N (as long as M
5
Sphere Packings, Lattices and Groups.
H. S. M. Coxeter, J. H. Conway, N. J. A. Sloane · American Mathematical Monthly · 1989 · 3.5K citations
The number of integral points on arcs and ovals
Enrico Bombieri, Jonathan Pila · Duke Mathematical Journal · 1989 · 292 citations
R. C. Vaughan · Bulletin of the London Mathematical Society · 1985 · 52 citations
Josef Gebel, A. Pethö, Horst G. Zimmer · Compositio Mathematica · 1998 · 52 citations · Full text