Abstract
This note presents a qualitative improvement to the algorithm presented in [DG] for computing Stark-Heegner points attached to an elliptic curve and a real quadratic field. This algorithm computes the Stark-Heegner point with ap-adic accuracy ofM significant digits in time which is polynomial inM, the primep being treated as a constant, rather than theO(p M ) operations required for the more naive approach taken in [DG]. The key to this improvement lies in the theory of overconvergent modular symbols developed in [PS1] and [PS2].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
