Related papers: Orienting supersingular isogeny graphs
Oriented graph complexes, in which graphs are not allowed to have oriented cycles, govern for example the quantization of Lie bialgebras and infinite dimensional deformation quantization. It is shown that the oriented graph complex GC^or_n…
In this paper, we study the problem of sampling random supersingular elliptic curves with unknown endomorphism rings. This problem has recently gained considerable attention as many isogeny-based cryptographic protocols require such…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
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…
We investigate oriented graphs based on the curve complex $C(S)$ of a closed surface $S$ and induced by functions on the vertex set of $C(S)$. In particular, we introduce the Dehn quasi-homothetic functions, which behave similarly to…
Supersingular isogeny graphs are known to have very few loops and multi-edges. We formalize this idea by studying and finding bounds for the number of loops and multi-edges in such graphs. We also find conditions under which the…
Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each element of $\mathcal{E}$ and an edge for each…
In this paper, we extend the ideas of graph pebbling to oriented graphs and find a classification for all graphs with fully traversable pebbling assignments that are isomorphic to their assignment graph. We then give some cases in which a…
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian…
We develop criteria based on a calibration argument via discrete PDE and semidiscrete optimal transport, for finding sharp isoperimetric inequalities of the form $(\sharp \Omega)^{d-1} \le C (\sharp \overrightarrow{\partial\Omega})^d$ where…
A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…
We introduce and investigate oriented dichromatic singular links. We also introduce oriented disingquandles and use them to define counting invariants for oriented dichromatic singular links. We provide some examples to show that these…
Supersingular elliptic curve $\ell$-isogeny graphs over finite fields offer a setting for a number of quantum-resistant cryptographic protocols. The security analysis of these schemes typically assumes that these graphs behave randomly.…
We provide an explicit classification of supersingular elliptic curves in characteristic~3 into isomorphism classes, and give explicit formulae for their point counts. This report was written specifically to support implementation of point…
Let $G=(V,E)$ be a simple graph. The concept of Inverse symmetric division deg index $(ISDD)$ was introduced in the chemical graph theory very recently. In spite of this, a few papers have already appeared with this index in the literature.…
We describe and illustrate the local neighbourhoods of vertices and edges in the (2, 2)-isogeny graph of principally polarized abelian surfaces, considering the action of automorphisms. Our diagrams are intended to build intuition for…
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
Motivated by his work on the classification of countable homogeneous oriented graphs, Cherlin asked about the typical structure of oriented graphs (i) without a transitive triangle, or (ii) without an oriented triangle. We give an answer to…
An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented…
An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of "hard supersingular curves" that is, equations for supersingular curves for which computing the…