Explicit Computation of the Abel-Jacobi Map and its Inverse
| atmire.migration.oldid | 5333 | |
| dc.contributor.advisor | Jacobson, Michael John Jr. | |
| dc.contributor.advisor | Thomé, Emmanuel | |
| dc.contributor.author | Labrande, Hugo | |
| dc.contributor.committeemember | Gaudry, Pierrick | |
| dc.contributor.committeemember | Scheidler, Renate | |
| dc.contributor.committeemember | Boxall, John | |
| dc.contributor.committeemember | Hanrot, Guillaume | |
| dc.date.accessioned | 2017-01-31T21:27:41Z | |
| dc.date.available | 2017-01-31T21:27:41Z | |
| dc.date.issued | 2017 | |
| dc.date.submitted | 2017 | en |
| dc.description.abstract | The Abel-Jacobi map links the short Weierstrass form of a complex elliptic curve to the complex torus associated to it. One can compute it with a number of operations which is quasi-linear in the target precision, i.e. in time O(M(P ) log P ). Its inverse is given by Weierstrass’s p-function, which can be written as a function of θ, an important function in number theory. The natural algorithm for evaluating θ requires O(M(P) sqrt(P) ) operations, but some values (the theta-constants) can be computed in O(M(P) log P ) operations by exploiting the links with the arithmetico-geometric mean (AGM). In this manuscript, we generalize this algorithm in order to compute θ in O(M(P) log P ). We give a function F which has similar properties to the AGM. As with the algorithm for theta-constants, we can then use Newton’s method to compute the value of θ. We implemented this algorithm, which is faster than the naive method for precisions larger than 260,000 decimal digits. We then study the generalization of this algorithm in higher genus, and in particular how to generalize the F function. In genus 2, we managed to prove that the same method leads to a O(M(P) log P ) algorithm for θ; the same complexity applies to the Abel-Jacobi map. This algorithm is faster than the naive method for precisions smaller than in genus 1, of about 3,000 decimal digits. We also outline a way one could reach the same complexity in any genus. Finally, we study a new algorithm which computes an isogeny of elliptic curves with given kernel. This algorithm uses the Abel-Jacobi map because it is easy to evaluate the isogeny on the complex torus; this algorithm may be generalizable to higher genera. | en_US |
| dc.identifier.citation | Labrande, H. (2017). Explicit Computation of the Abel-Jacobi Map and its Inverse (Doctoral thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/26073 | en_US |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/26073 | |
| dc.identifier.uri | http://hdl.handle.net/11023/3615 | |
| dc.language.iso | eng | |
| dc.publisher.faculty | Graduate Studies | |
| dc.publisher.institution | University of Calgary | en |
| dc.publisher.institution | Université de Lorraine | en |
| dc.publisher.place | Calgary | en |
| dc.rights | University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission. | |
| dc.subject | Mathematics | |
| dc.subject | Computer Science | |
| dc.subject.other | theta function | |
| dc.subject.other | abel-jacobi map | |
| dc.subject.other | multiprecision computation | |
| dc.title | Explicit Computation of the Abel-Jacobi Map and its Inverse | |
| dc.type | doctoral thesis | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | University of Calgary | |
| thesis.degree.name | Doctor of Philosophy (PhD) | |
| ucalgary.item.requestcopy | true |