Related papers: Isotopy classes of 3-periodic net embeddings
Knowledge graph embedding involves learning representations of entities -- the vertices of the graph -- and relations -- the edges of the graph -- such that the resulting representations encode the known factual information represented by…
In contrast with knots, whose properties depend only on their extrinsic topology in $S^3$, there is a rich interplay between the intrinsic structure of a graph and the extrinsic topology of all embeddings of the graph in $S^3$ . For…
We add two new 1-parameter families to the short list of known embedded triply periodic minimal surfaces of genus 4 in $\mathbb{R}^3$. Both surfaces can be tiled by minimal pentagons with two straight segments and three planar symmetry…
A graph is intrinsically knotted if every embedding contains a nontrivially knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that there are exactly 14 intrinsically knotted graphs with 21 edges, in…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
Many models learn representations of knowledge graph data by exploiting its low-rank latent structure, encoding known relations between entities and enabling unknown facts to be inferred. To predict whether a relation holds between…
We introduce the notion of fundamental heap for compact orientable surfaces with boundary embedded in $3$-space, which is an isotopy invariant of the embedding. It is a group, endowed with a ternary heap operation, defined using diagrams of…
Alignable nets are grid structures that can collapse to a planar strip, which is in fact the real-world counterpart of a curve. This property simplifies on-site assembly and enables compact transport and storage. These grid structures can…
We study a problem of geometric graph theory: We determine the triply periodic graph in Euclidean 3-space which minimizes length among all graphs spanning a fundamental domain of 3-space with the same volume. The minimizer is the so-called…
We define an isotopy invariant of embeddings N -> R^m of manifolds into Euclidean space. This invariant together with the \alpha-invariant of Haefliger-Wu is complete in the dimension range where the \alpha-invariant could be incomplete. We…
We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a probability density…
An ordinary voltage graph embedding of a graph in a surface encodes a certain kind of highly symmetric covering space of that surface. Given an ordinary voltage graph embedding of a graph $G$ in a surface with voltage group $A$ and a…
A generic immersion of a planar graph into the 2-space is said to be knotted if there does not exist a trivial embedding of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space…
We list more than 200 new examples of minor minimal intrinsically knotted graphs and describe many more that are intrinsically knotted and likely minor minimal.
Spin networks are graphs derived from 3nj symbols of angular momentum. The surface embedding, the topology and dualization of these networks are considered. Embeddings into compact surfaces include the orientable sphere S^2 and the torus T,…
In this paper we study some consequences of the author's classification of graph manifolds by their profinite fundamental groups. In particular we study commensurability, the behaviour of knots, and relation to mapping classes. We prove…
The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture…
We classify Legendrian torus knots and figure eight knots in the tight contact structure on the 3-sphere up to Legendrian isotopy. As a corollary to this we also obtain the classification of transversal torus knots and figure eight knots up…
In this paper we study embeddings of oriented connected closed surfaces in $\mathbb S^3$. We define a complete invariant, the fundamental span, for such embeddings, generalizing the notion of the peripheral system of a knot group. From the…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…