Related papers: Orienting supersingular isogeny graphs
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
We describe the neighborhood of the vertex $[E_0]$ (resp. $[E_{1728}]$) in the $\ell$-isogeny graph $\mathcal{G}_\ell(\mathbb{F}_{p^2}, -2p)$ of supersingular elliptic curves over the finite field $\mathbb{F}_{p^2}$ when $p>3\ell^2$ (resp.…
A given order type in the plane can be represented by a point set. However, it might be difficult to recognize the orientations of some point triples. Recently, Aichholzer \etal \cite{abh19} introduced exit graphs for visualizing order…
In the present paper we extend the theory of sheaves on moment graphs due to Braden-MacPherson and Fiebig to the context of an arbitrary oriented equivariant cohomology h (e.g. to algebraic cobordism). We introduce and investigate structure…
In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that…
We extend symbolic protocol analysis to apply to protocols using Diffie-Hellman operations. Diffie-Hellman operations act on a cyclic group of prime order, together with an exponentiation operator. The exponents form a finite field. This…
We prove the connectedness and calculate the diameter of the oriented graph of graftings associated to exotic complex projective structures on a compact surface S with a given holonomy representation of Fuchsian type. The oriented graph of…
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…
This paper is concerned with difference equations on elliptic curves. We establish some general properties of the difference Galois groups of equations of order two, and give applications to the calculation of some difference Galois groups.…
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…
Finite element codes typically use data structures that represent unstructured meshes as collections of cells, faces, and edges, each of which require associated coordinate systems. One then needs to store how the coordinate system of each…
A directed graph $D$ is singly connected if for every ordered pair of vertices $(s,t)$, there is at most one path from $s$ to $t$ in $D$. Graph orientation problems ask, given an undirected graph $G$, to find an orientation of the edges…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
An oriented graph is a directed graph without any cycle of length at most 2. To push a vertex of a directed graph is to reverse the orientation of the arcs incident to that vertex. Klostermeyer and MacGillivray defined push graphs which are…
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…
This paper studies the problem of conducting self-supervised learning for node representation learning on graphs. Most existing self-supervised learning methods assume the graph is homophilous, where linked nodes often belong to the same…
In our previous works, we introduced, for each (super)manifold, a commutative algebra of densities. It is endowed with a natural invariant scalar product. In this paper, we study geometry of differential operators of second order on this…
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…
Out-of-distribution (OOD) graph generalization are critical for many real-world applications. Existing methods neglect to discard spurious or noisy features of inputs, which are irrelevant to the label. Besides, they mainly conduct…