Counting elliptic curves with prescribed entanglements
Abstract
We establish asymptotic lower bounds for the number of elliptic curves over Q with prescribed entanglement of division fields, ordered by naive height. Such elliptic curves are obtained as 1-parameter families arising from certain genus 0 modular curves. We apply techniques from the geometry of numbers and sieve methods to prove that the number of elliptic curves with unexplained entanglements Q(E[2]) Q(E[3]) ≠ Q and Q(E[2]) Q(E[5]) ≠ Q and naive height ≤ X, grows as X1/9 and X1/12, respectively.
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.