相关论文: Orienting supersingular isogeny graphs

Graph neural networks (GNNs) are proven effective in extracting complex node and structural information from graph data. While current GNNs perform well in node classification tasks within in-distribution (ID) settings, real-world scenarios…

We give characterizations of the structure and degree sequences of hereditary unigraphs, those graphs for which every induced subgraph is the unique realization of its degree sequence. The class of hereditary unigraphs properly contains the…

An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…

We give a homological interpretation of the coefficients of the Hilbert series for an algebra associated with a directed graph and its dual algebra. This allows us to obtain necessary conditions for Koszulity of such algebras in terms of…

We consider families of schemes over arbitrary fields resp. analytic varieties with finitely many (not necessarily reduced) isolated non-normal singularities, in particular families of generically reduced curves. We define a modified delta…

We explore the relationship between (3-isogeny induced) Selmer group of an elliptic curve and the (3 part of) the ideal class group, over certain non-abelian number fields.

Let p>3 be a prime and let E, E' be supersingular elliptic curves over F_p. We want to construct an isogeny phi: E --> E'. The currently fastest algorithm for finding isogenies between supersingular elliptic curves solves this problem by…

We present a proposal for an undeniable signature scheme based in supersingular hyperelliptic curves of genus 2.

We introduce a novel formulation for guided super-resolution. Its core is a differentiable optimisation layer that operates on a learned affinity graph. The learned graph potentials make it possible to leverage rich contextual information…

Occluded person re-identification (ReID) aims to match occluded person images to holistic ones across dis-joint cameras. In this paper, we propose a novel framework by learning high-order relation and topology information for discriminative…

Living in a complex world like ours makes it unacceptable that a practical implementation of a machine learning system assumes a closed world. Therefore, it is necessary for such a learning-based system in a real world environment, to be…

Let $G$ be a finite subgroup of $\text{SL}(2,\Bbbk)$ and let $R = \Bbbk[x,y]^G$ be the coordinate ring of the corresponding Kleinian singularity. In 1998, Crawley-Boevey and Holland defined deformations $\mathcal{O}^\lambda$ of $R$…

We develop a categorical index calculus for elliptic symbol families. The categorified index problems we consider are a secondary version of the traditional problem of expressing the index class in K-theory in terms of…

Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…

Graph-level representation learning is important in a wide range of applications. Existing graph-level models are generally built on i.i.d. assumption for both training and testing graphs. However, in an open world, models can encounter…

We introduce topological parallelisms of oriented lines (briefly called oriented parallelisms). Every topological parallelism (of lines) on PG(3,R) gives rise to a parallelism of oriented lines, but we show that even the most homogeneous…

The Lachlan-Woodrow Theorem identifies ultrahomogeneous graphs up to isomorphism. Recently, the present author and D. Hartman classified MB-homogeneous graphs up to bimorphism-equivalence. We extend those results in this paper, showing that…

We introduce $C^*$-algebras associated with directed graphs, along with two generalizations of this concept, namely Exel-Pardo $C^*$-algebras associated with a self-similar action of a group on a directed graph, and the $C^*$-algebras…

Oriented graph discrepancy problems focus on finding specific subgraphs within a given oriented graph $G$ that contain a significant number of edges in one direction. This concept was first introduced by Gishboliner, Krivelevich, and…

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…