Algorithms for modular elliptic curves
Algorithms for modular elliptic curves
A course in computational algebraic number theory
A course in computational algebraic number theory
Computing a lower bound for the canonical height on elliptic curves over ℚ
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Hi-index | 0.00 |
Computing a lower bound for the canonical height is a crucialstep in determining a Mordell-Weil basis of an elliptic curve. This paperpresents a new algorithm for computing such lower bound, which canbe applied to any elliptic curves over totally real number fields. Thealgorithm is illustrated via some examples.