Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph

01/04/2021
by   Enric Florit, et al.
0

We investigate special structures due to automorphisms in isogeny graphs of principally polarized abelian varieties, and abelian surfaces in particular. We give theoretical and experimental results on the spectral and statistical properties of (2, 2)-isogeny graphs of superspecial abelian surfaces, including stationary distributions for random walks, bounds on eigenvalues and diameters, and a proof of the connectivity of the Jacobian subgraph of the (2, 2)-isogeny graph. Our results improve our understanding of the performance and security of some recently-proposed cryptosystems, and are also a concrete step towards a better understanding of general superspecial isogeny graphs in arbitrary dimension.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/04/2019

Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities

We establish and generalise several bounds for various random walk quant...
research
06/23/2020

On the flip graphs on perfect matchings of complete graphs and signed reversal graphs

In this paper, we study the flip graph on the perfect matchings of a com...
research
10/29/2019

Improved spectral convergence rates for graph Laplacians on epsilon-graphs and k-NN graphs

In this paper we improve the spectral convergence rates for graph-based ...
research
05/02/2022

Eigenstripping, Spectral Decay, and Edge-Expansion on Posets

Fast mixing of random walks on hypergraphs has led to myriad breakthroug...
research
03/17/2021

Adjacency Graphs of Polyhedral Surfaces

We study whether a given graph can be realized as an adjacency graph of ...
research
03/01/2018

Strong Subgraph k-connectivity

Generalized connectivity introduced by Hager (1985) has been studied ext...
research
06/18/2020

An Alon-Boppana theorem for powered graphs and generalized Ramanujan graphs

The r-th power of a graph modifies a graph by connecting every vertex pa...

Please sign up or login with your details

Forgot password? Click here to reset