Related papers: Isogeny volcanoes

Let $p,q,l$ be three distinct prime numbers and let $N$ be a positive integer coprime to $pql$. For an integer $n\ge 0$, we define the directed graph $X_l^q(p^nN)$ whose vertices are given by isomorphism classes of elliptic curves over a…

Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…

We define three different isogeny graphs of principally polarized superspecial abelian varieties, prove foundational results on them, and explain their role in number theory and geometry. This is background to joint work with Yevgeny…

Let p>3 be a prime and let E, E' be supersingular elliptic curves over F_p. We want to construct an isogeny phi: E --> E'. The currently fastest algorithm for finding isogenies between supersingular elliptic curves solves this problem by…

Elliptic curve cryptography has received great attention in recent years due to its high resistance against modern cryptanalysis. The aim of this article is to present efficient generators to generate substitution boxes (S-boxes) and pseudo…

We count by height the number of elliptic curves over the rationals that possess an isogeny of degree three.

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

The intrinsically secure communications graph (iS-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence of eavesdroppers. It is based on principles of…

We consider character sums determined by isogenies of elliptic curves over finite fields. We prove a congruence condition for character sums attached to arbitrary cyclic isogenies, and produce explicit formulas for isogenies of small…

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…

This note contains an elementary discussion of the Arakelov intersection theory of elliptic curves. The main new results are a projection formula for elliptic arithmetic surfaces and a formula for the "energy" of an isogeny between Riemann…

Let $n>1$ be an integer such that $X_{0}\!\left( n\right) $ has genus $0$, and let $K$ be a field of characteristic $0$ or relatively prime to $6n$. In this article, we explicitly classify the isogeny graphs of all rational elliptic curves…

A well-known and difficult problem in computational number theory and algebraic geometry is to write down equations for branched covers of algebraic curves with specified monodromy type. In this article, we present a technique for computing…

This article explores the connection between radical isogenies and modular curves. Radical isogenies are formulas designed for the computation of chains of isogenies of fixed small degree $N$, introduced by Castryck, Decru, and Vercauteren…

We define and study graphs associated to hexagon decompositions of surfaces by curves and arcs. One of the variants is shown to be quasi-isometric to the pants graph, whereas the other variant is quasi-isometric to (a Cayley graph of) the…

Topological Coding consists of two different kinds of mathematics: topological structure and mathematical relation. The colorings and labelings of graph theory are main techniques in topological coding applied in asymmetric encryption…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

In the first part of the paper, we fix a non-CM elliptic curve $E/\mathbb{Q}$ and an odd prime $\ell$ and investigate the distribution of invariants associated to the $\ell$-volcano containing the reduction $E_p$, as $p$ ranges over primes…

We present a construction of expander graphs obtained from Cayley graphs of narrow ray class groups, whose eigenvalue bounds follow from the Generalized Riemann Hypothesis. Our result implies that the Cayley graph of (Z/qZ)* with respect to…

In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…