Related papers: The supersingular isogeny problem in genus 2 and b…

The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…

We describe the use of explicit isogenies to translate instances of the Discrete Logarithm Problem (DLP) from Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, where they are vulnerable to faster…

Let $G$ be a finite group and let $\pi(G)=\{p_1, p_2, \ldots, p_k\}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<\cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${\rm GK}(G)$, is defined as follows: its vertex set is…

Faltings's isogeny theorem states that two abelian varieties are isogenous over a number field precisely when the characteristic polynomials of the reductions at almost all prime ideals of the number field agree. This implies that two…

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…

In supersingular isogeny-based cryptography, the path-finding problem reduces to the endomorphism ring problem. Can path-finding be reduced to knowing just one endomorphism? It is known that a small endomorphism enables polynomial-time…

For $G$ a finite group acting linearly on $\mathbb{A}^2$, the equivariant Hilbert scheme $\operatorname{Hilb}^r[\mathbb{A}^2/G]$ is a natural resolution of singularities of $\operatorname{Sym}^r(\mathbb{A}^2/G)$. In this paper we study the…

Last year Takashima proposed a version of Charles, Goren and Lauter's hash function using Richelot isogenies, starting from a genus-2 curve that allows for all subsequent arithmetic to be performed over a quadratic finite field Fp2. In a…

Extending the results of [Asian J. Math. 2019], in [Doc. Math. \textbf{21}, 2016] we calculated explicitly the number of isomorphism classes of superspecial abelian surfaces over an arbitrary finite field of \textit{odd} degree over the…

We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…

In this paper, we study the Cassels-Tate pairing on Jacobians of genus two curves admitting a special type of isogenies called Richelot isogenies. Let $\phi: J \rightarrow \widehat{J}$ be a Richelot isogeny between two Jacobians of genus…

Let $q$ be an odd power of a prime $p\in \mathbb{N}$, and $\mathrm{PPSP}(\sqrt{q})$ be the finite set of isomorphism classes of principally polarized superspecial abelian surfaces in the simple isogeny class over $\mathbb{F}_q$…

We describe and compare algorithms for computing supersingular isogeny graphs. Along the way, we obtain a formula for the trace of the adjacency matrix of a general supersingular isogeny graph, and we prove a conjecture recently posed by…

We study the modular curves defined by Weber functions, and associated modular polynomials, action of $\mathrm{SL}_2(\mathbb{Z})$, and parametrizations of elliptic curves with a view to the study of the isogeny graphs that they determine,…

There is a well known theorem by Deuring which gives a criterion for when the reduction of an elliptic curve with complex multiplication (CM) by the ring of integers of an imaginary quadratic field has ordinary or supersingular reduction.…

Let $c<3p/16$ be a prime or $c=1$. Let $E$ be a $\mathbb{Z}[\sqrt{-cp}]$-oriented supersingular elliptic curve defined over $\mathbb{F}_{p^2}$. There exists a $c$-isogeny from $E$ to $E^p$ with kernel $G \subset E[c]$. Given an Eichler…

Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G(P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$, such that two paths are adjacent if one can be obtained from the…

In geometry processing, numerical optimization methods often involve solving sparse linear systems of equations. These linear systems have a structure that strongly resembles to adjacency graphs of the underlying mesh. We observe how…

Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call $h$-Clique2Path Planarity: Given a graph $G$, whose vertices are partitioned into subsets of size at most $h$, each…

Let $F$ be a $2$-regular graph of order $v$. The Oberwolfach problem $OP(F)$, posed in 1967 and still open, asks for a decomposition of $K_v$ into copies of $F$. In this paper we show that $OP(F)$ has a solution whenever $F$ has a…