Zeta functions of abstract isogeny graphs and modular curves
Abstract
We introduce a ``non-orientable'' variation of Serre's definition of a graph, which we call an abstract isogeny graph. These objects capture the combinatorics of the graphs G(p,,H), the -isogeny graphs of supersingular elliptic curves with H-level structure. In particular they allow for the study of non-backtracking walks, primes, and zeta functions. We prove an analogue of Ihara's determinant formula for the zeta function of an abstract isogeny graph. For B1(N) ⊂eq H ⊂eq B0(N) and p > 3, we use this formula to relate the Ihara zeta function of G(p,,H) to the Hasse-Weil zeta functions of the modular curves XH, F and XH × B0(p), F. As applications, we give an explicit formula relating point counts on X0(pN)F and X0(N)F to cycle counts in G(p,,B0(N)) and prove that the number of non-backtracking cycles of length r in G(p,,B0(N)) is asymptotic to r.
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.