Elementary Matrix Decomposition and The Computation of Darmon Points with Higher Conductor

preprint2012arXivOpen access

Abstract

We extend the algorithm of Darmon-Green and Darmon-Pollack for computing p-adic Darmon points on elliptic curves to the case of composite conductor. We also extend the algorithm of Darmon-Logan for computing ATR Darmon points to treat curves of nontrivial conductor. Both cases involve an algorithmic decomposition into elementary matrices in congruence subgroups Γ(N) for ideals N in certain rings of S-integers. We use these extensions to provide additional evidence in support of the conjectures on the rationality of Darmon points.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.