The solvability of the inverse volcano problem over non-prime finite fields
Abstract
For a finite field Fpk and a prime ≠ p, consider the graph G of -isogenies between ordinary elliptic curves over Fpk. Kohel proved that the connected components of G have a remarkable structure, now called an -volcano graph. Bambury, Campagna, and Pazuki investigated the inverse volcano problem: given a volcano graph V, can one find it as a connected component of G over Fpk? They gave a complete positive answer over Fp, and described a specific counterexample over Fp2. In this paper, we generalise the results of Bambury-Campagna-Pazuki by providing a precise framework for the inverse volcano problem over Fpk. The solvability of the problem for an -volcano graph V of depth d is typically determined by the relation between d and the -valuation r of k. When r is small in comparison to d, we prove that there are infinitely many primes p solving the inverse problem for V. The situation where r is large in comparison to d is more delicate: in many cases we prove that the inverse problem for V is unsolvable; in a few other cases the problem appears to be solvable, but our proof of this is conditional on a variant of the Cohen-Lenstra heuristics for class groups of imaginary quadratic fields. We provide some computational evidence in support of these modified heuristics.
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.