Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
@ChrisWuthrich I agree. I'm interested in this because of a theorem by Silverman which gives an explicit upper bound for the number of integral solutions for these curves.
I'm trying to solve a question that actually needs the most explicit bound possible, the best I've found is $10h_{3}(-108d)$ where $h_3(-108d)$ is the class number for cubic form with a discriminant $d$ — and since we don't have an estimate on the bound of the rank of elliptic curves, I don't know what to do. In case you're interested, the actual problem I'm solving is how many elliptic curves exist such that $y^2 = x^3 + D$ has exactly $D$ solutions
Thank you so much. I have one last question: Do you know of any papers where an explicit bound for the number of solutions is given in terms of the discriminant (apart from the one I mentioned)? Either way, thank you very much for your response!
@2734364041 Thank you for your response. Two questions: Firstly, isn't theorem 1.2 related to the number of $S$ integral points over an elliptic curve instead of just the integral points? Secondly, why do people believe $\mathrm{rank}(E_{A,B})<c$? Didn't Prof. Elkies discover a curve with rank $28$?
Yes, I need to know the explicit bound $C$ in order to do some computations about specific solutions to Mordell Equations. If I have to find the constant, how would I go about doing it? Also, what evidence points to $C$ being effectively computable? I know it doesn't depend upon Roth's theorem, which is a good sign..