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 $\ell\neq p$ two rational points with complex multiplication can have equal reduction modulo $\ell$.
Fields of Study & Subjects
Algebraic Geometry and Number Theory
Cryptography and Residue Arithmetic
Algebraic and Geometric Analysis
Publication details
- Journal / source
- Mathematics of Computation
- Publication date
- 19 September 2026
- Language
- EN