Related papers: Double-orientations on supersingular isogeny graph…
A formula is given for the dimension of the Selmer group of the rational three-isogeny of elliptic curves of the form y^2=x^3+a(x-b)^2. The formula is in terms of the three-ranks of the quadratic number fields Q(\sqrt{a}) and Q(\sqrt{-3a})…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
We present a deterministic and explicit algorithm to compute the endomorphism rings of supersingular elliptic curves. As an example we compute the endomorphism rings of all supersingular elliptic curves defined over characteristic…
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…
Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…
We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…
Using techniques from supergravity and dimensional reduction, we study the full isometry algebra of K\"ahler and quaternionic manifolds with special geometry. These two varieties are related by the so-called c-map, which can be understood…
We study graph-directed conjugate functional equations on the unit interval indexed by the complete digraph with self-loops on two vertices. We focus on the singularity and regularity of the solutions for compatible systems of weak…
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…
We describe the topology of singular real algebraic curves in a smooth surface. We enumerate and bound in terms of the degree the number of topological types of singular algebraic curves in the real projective plane.
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…
Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…
We find the first examples of real hypersurfaces with two nonconstant principal curvatures in complex projective and hyperbolic planes, and we classify them. It turns out that each such hypersurface is foliated by equidistant Lagrangian…
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…
One describes those double structures on rational normal curves which are defined scheme theoretically by quadratic equations and have linear syzygies, generalizing this way the double line in the plane
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
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…
We present explicit descriptions of the decompositions of vertices of a hypercube graph with respect to its distinguished symmetric cycle.
Learning-based methods for routing have gained significant attention in recent years, both in single-objective and multi-objective contexts. Yet, existing methods are unsuitable for routing on multigraphs, which feature multiple edges with…
A graph is beyond-planar if it can be drawn in the plane with a specific restriction on crossings. Several types of beyond-planar graphs have been investigated, such as k-planar if every edge is crossed at most k times and RAC if edges can…