Related papers: Parallelization of Welded Links
Doubly periodic tangles (DP tangles) are configurations of curves embedded in the thickened plane, invariant under translations in two transversal directions. In this paper we extend the classical theory of DP tangles by introducing the…
Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove that every reflexive directed graph can be interpreted as a program…
We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…
The minimal coloring number of a $\mathbb{Z}$-colorable link is the minimal number of colors for non-trivial $\mathbb{Z}$-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable…
In this survey paper we present the $L$--moves between braids and how they can adapt and serve for establishing and proving braid equivalence theorems for various diagrammatic settings, such as for classical knots, for knots in knot…
Multi-relational graph is a ubiquitous and important data structure, allowing flexible representation of multiple types of interactions and relations between entities. Similar to other graph-structured data, link prediction is one of the…
Graph embedding methods embed the nodes in a graph in low dimensional vector space while preserving graph topology to carry out the downstream tasks such as link prediction, node recommendation and clustering. These tasks depend on a…
Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…
We prove that for some knot-like objects one can easily recognize non-equivalence w.r.t. all Reidemeister moves by studying some equivalence classes modulo only 2nd Reidemeister moves. There are applications to virtual knots, graph-links…
In 2002, D. Hrencecin and L.H. Kauffman defined a filamentation invariant on oriented chord diagrams that may determine whether the corresponding flat virtual knot diagrams are non-trivial. A virtual knot diagram is non-classical if its…
A quandle is an algebraic structure whose axioms correspond to the Reidemeister moves of knot theory. S. Kamada introduced the notion of a quandle with a good involution, which is later called a symmetric quandle. We are interested in the…
In the present paper we give a new method for converting virtual knots and links to virtual braids. Indeed the braiding method given in this paper is quite general, and applies to all the categories in which braiding can be accomplished. We…
Diagrams enable the use of various algebraic and geometric tools for analysing and classifying knots. In this paper we introduce a new diagrammatic representation of triply periodic entangled structures (TP tangles), which are embeddings of…
For a connected graph, we define the proper-walk connection number as the minimum number of colors needed to color the edges of a graph so that there is a walk between every pair of vertices without two consecutive edges having the same…
Federated graph learning collaboratively learns a global graph neural network with distributed graphs, where the non-independent and identically distributed property is one of the major challenges. Most relative arts focus on traditional…
This paper demonstrates that parallel vector curves are piecewise cubic rational curves in 3D piecewise linear vector fields. Parallel vector curves -- loci of points where two vector fields are parallel -- have been widely used to extract…
Link prediction is one important application of graph neural networks (GNNs). Most existing GNNs for link prediction are based on one-dimensional Weisfeiler-Lehman (1-WL) test. 1-WL-GNNs first compute node representations by iteratively…
This paper defines a notion of parallel transport in a lattice of quantum particles, such that the transformation associated with each link of the lattice is determined by the quantum state of the two particles joined by that link. We focus…
In order to define graph transformations by the simultaneous application of concurrent rules, we have adopted in previous work a structure of attributed graphs stable by unions. We analyze the consequences on parallel independence, a…
Distance based knowledge graph embedding methods show promising results on link prediction task, on which two topics have been widely studied: one is the ability to handle complex relations, such as N-to-1, 1-to-N and N-to-N, the other is…