Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-06T22:59:50.991Z Has data issue: false hasContentIssue false

Isogeny graphs on superspecial abelian varieties: eigenvalues and connection to Bruhat–Tits buildings

Published online by Cambridge University Press:  20 October 2023

Yusuke Aikawa
Affiliation:
Graduate School of Information Science and Technology, The University of Tokyo, Tokyo 113-8656, Japan e-mail: aikawa@mist.i.u-tokyo.ac.jp
Ryokichi Tanaka
Affiliation:
Department of Mathematics, Kyoto University, Kyoto 606-8502, Japan e-mail: rtanaka@math.kyoto-u.ac.jp
Takuya Yamauchi*
Affiliation:
Mathematical Institute, Tohoku University, Sendai 980-8578, Japan
Rights & Permissions [Opens in a new window]

Abstract

We study for each fixed integer $g \ge 2$, for all primes $\ell $ and p with $\ell \neq p$, finite regular directed graphs associated with the set of equivalence classes of $\ell $-marked principally polarized superspecial abelian varieties of dimension g in characteristic p, and show that the adjacency matrices have real eigenvalues with spectral gaps independent of p. This implies a rapid mixing property of natural random walks on the family of isogeny graphs beyond the elliptic curve case and suggests a potential construction of the Charles–Goren–Lauter-type cryptographic hash functions for abelian varieties. We give explicit lower bounds for the gaps in terms of the Kazhdan constant for the symplectic group when $g \ge 2$. As a byproduct, we also show that the finite regular directed graphs constructed by Jordan and Zaytman also has the same property.

Information

Type
Article
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of The Canadian Mathematical Society
Figure 0

Figure 1: An illustration of $Gr_2(2,13)$. The vertices $v_1$, $v_2$, and $v_3$ denote the Jacobians of some curves of genus 2. The vertex $v_4$ denotes the product of some supersingular elliptic curves. The number on the side of a directed edge denotes the multiplicity of each edge. For a more detailed illustration, see Section 7.1 of [KT20].