Computing with necklaces on elliptic curves
Abstract
We present computational algorithms to work with points on the modular curve associated to the normaliser of a non-split Cartan group of prime level p. Rather than working with explicit equations, we represent these points using the moduli interpretation of necklaces in the p-torsion of elliptic curves. We use our methods to investigate for which primes ≠ p two rational points with complex multiplication can have equal reduction modulo .
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.