Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I wanted to ask about some existing algorithms for computing points over elliptic curves.

Background : We know that the famous theorem of Mordell and Weil says that " Group of rational points on an elliptic curve is finitely generated " . i.e. $E(\mathbb{Q})=\mathbb{Z}^{r}\oplus E_{\rm{torsion}}(\mathbb{Q})$ . So we can find the torsion points a bit easily by using theorem of Nagell and Lutz.

My main question is that

  • How can we find the free part ? ( I mean points of infinite order ) . I have read that we can just use the homogeneous spaces ( Torsors ) and just dig for some points with infinite order. But its well known that they are not such efficient methods that apply universally and work every time. So are there any other known ( Efficient ) methods for computing the points of infinite order ? , apart from using Homogeneous spaces.

P.S : Apart from this, giving rational points on the original elliptic curve corresponds to giving sections of the projection $S \to C$ ( where $S$ is elliptic surface over curve $C$ ). To determine such sections essentially amounts to determining all the curves lying on $S$ that can be defined over $\mathbb F$ ( where $F$ is a finite field where $C$ lies ).

So is there any anagolous way of finding the points of infinite order by considering the associated surfaces. Is there any work done in that direction ? ( Any good references to read further )

Thank you.

share|improve this question

1 Answer 1

up vote 2 down vote accepted

The method of descent is the only "algorithm" we know that will determine the points of infinite order on an elliptic curve. It is not an algorithm until someone proves that Sha(E/Q) is finite... and even if someone proves this, the algorithm is not very efficient on curves with large conductor (i.e., it may take an enormous amount of time for the method to work, and it might require several consecutive descents, which is hard to implement - and not implemented in the generality that it would be needed for the method to work every time).

The method of descent (and a discussion about its efficiency and dependency on Sha) is very nicely described in Silverman's "The arithmetic of elliptic curves".

share|improve this answer
    
But, I have some idea in my mind. Can we use the coefficient predicted by Birch and Swinnerton-Dyer to compute the Regulator and later compute the heights of points and then search for homogeneous spaces that have the obtained height and then obtain the corresponding point of finite order. Sir, I need to learn some methods for computing coefficients and then try this. I realized that B.S.D apart from giving the cardinality of Mordell-Weil group, also should suggest some good way of computing points of infinite order. And some constraints have to be fulfilled to do so, like the one you said. –  Iyengar Feb 22 '12 at 16:52
    
But am I going in right path sir ? . Thanks a ton, for answering my question. $+\infty$, but my ability is limited in only giving $+1$. –  Iyengar Feb 22 '12 at 16:53
    
BS-D is a conjecture so, at best, you would get an "algorithm" until BS-D is proved. However, if the rank > 1, how do you get the height of each generator point from the regulator? –  Álvaro Lozano-Robledo Feb 22 '12 at 16:56
    
Yes sir, it would indeed fail if rank$\gt1$ , and many considerations like parity conjecture etc, come into play. But will my idea atleast work when rank$=1$ ( and if B.SD is assumed to be true ) ? , if so, I wanted to do some calculations, and submit my work to a journal. But does idea makes sense ? , and is new ? . Thank you. @Alvaro Lozano-Robledo –  Iyengar Feb 22 '12 at 17:24
1  
This is not a new idea. But just for fun, let $E: y^2=x^3-157^2x$. This curve has rank $1$. Can you find the generator using your method? –  Álvaro Lozano-Robledo Feb 22 '12 at 17:26

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.