SearcharxivSearch

arXiv subjects

Gabrielle Scullard

Publications and source records attributed to Gabrielle Scullard.

3 recordsLinked to original sources

Zeta functions of abstract isogeny graphs and modular curves

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,\ell,H)$, the $\ell$-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 $B_1(N) \subseteq H \subseteq B_0(N)$ and $p > 3$, we use this formula to relate the Ihara zeta function of $G(p,\ell,H)$ to the Hasse-Weil zeta functions of the modular curves $X_{H, {\mathbb{F}_{\ell}}}$ and $X_{H \times B_0(p), \mathbb{F}_{\ell}}$. As applications, we give an explicit formula relating point counts on $X_0(pN)_{\mathbb{F}_{\ell}}$ and $X_0(N)_{\mathbb{F}_{\ell}}$ to cycle counts in $G(p,\ell,B_0(N))$ and prove that the number of non-backtracking cycles of length $r$ in $G(p,\ell,B_0(N))$ is asymptotic to $\ell^r$.

math.NT

Connecting Kani's Lemma and path-finding in the Bruhat-Tits tree to compute supersingular endomorphism rings

We give a deterministic polynomial time algorithm to compute the endomorphism ring of a supersingular elliptic curve in characteristic p, provided that we are given two noncommuting endomorphisms and the factorization of the discriminant of the ring $\mathcal{O}_0$ they generate. At each prime $q$ for which $\mathcal{O}_0$ is not maximal, we compute the endomorphism ring locally by computing a q-maximal order containing it and, when $q \neq p$, recovering a path to $\text{End}(E) \otimes \mathbb{Z}_q$ in the Bruhat-Tits tree. We use techniques of higher-dimensional isogenies to navigate towards the local endomorphism ring. Our algorithm improves on a previous algorithm which requires a restricted input and runs in subexponential time under certain heuristics. Page and Wesolowski give a probabilistic polynomial time algorithm to compute the endomorphism ring on input of a single non-scalar endomorphism. Beyond using techniques of higher-dimensional isogenies to divide endomorphisms by a scalar, our methods are completely different.

math.NT