Related papers: Double-orientations on supersingular isogeny graph…

We establish a classification of the values of \( N \) for which an elliptic curve defined over \( \mathbb{Q} \) with square discriminant admits an \( N \)-isogeny. Furthermore, we determine the values of \( N \) for which two elliptic…

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…

Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…

We apply classical invariant theory of binary forms to explicitly characterize isomorphism classes of hyperelliptic curves of small genus and, conversely, propose algorithms for reconstructing hyperelliptic models from given invariants. We…

Isogenous elliptic curves have the same conductor but not necessarily the same minimal discriminant ideal. In this article, we explicitly classify all $p^2$-isogenous elliptic curves defined over a number field with the same minimal…

Isotopic pairs and their representations are considered in a general framework of the vector superalgebra. Numerous examples of finite-dimensional and infinite-dimensional isotopic pairs are discussed. Several types of their representations…

Computing endomorphism rings of supersingular elliptic curves is an important problem in computational number theory, and it is also closely connected to the security of some of the recently proposed isogeny-based cryptosystems. In this…

We consider the ideal orientation problem in planar graphs. In this problem, we are given an undirected graph $G$ with positive edge lengths and $k$ pairs of distinct vertices $(s_1, t_1), \dots, (s_k, t_k)$ called terminals, and we want to…

We extend the duality between acyclic orientations and totally cyclic orientations on planar graphs to dualities on graphs on orientable surfaces by introducing boundary acyclic orientations and totally bi-walkable orientations. In…

Let $n$ be an integer such that the modular curve $X_0(n)$ is hyperelliptic of genus $\ge2$ and such that the Jacobian of $X_0(n)$ has rank $0$ over $\mathbb Q$. We determine all points of $X_0(n)$ defined over quadratic fields, and we give…

Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…

We show how the exceptional isogenies of classical groups to orthogonal groups of quadratic spaces of dimensions up to 8 over fields of characteristic different from 2 may be obtained by explicit algebraic constructions using the…

Bidirected graphs generalize directed and undirected graphs in that edges are oriented locally at every node. The natural notion of the degree of a node that takes into account (local) orientations is that of net-degree. In this paper, we…

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 show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…

Let $E$ be a non CM elliptic curve defined over $\Q$. There is an isogeny-torsion graph associated to $E$ and there is also a Galois representation $\rho_{E,l^{\infty}} \colon \Gal(\Qbar/\Q) \to \GL_2(\ZZ_{\ell})$ associated to $E$ for…

A vertex with neighbours of degrees $d_1 \geq ... \geq d_r$ has {\em vertex type} $(d_1, ..., d_r)$. A graph is {\em vertex-oblique} if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and…

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…

Let $l$ and $p$ be two distinct prime numbers. We study $l$-isogeny graphs of ordinary elliptic curves defined over a finite field of characteristic $p$, together with a level structure. Firstly, we show that as the level varies over all…