Related papers: Unlinked Embedded Graphs
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…
This paper defines a new invariant of virtual knots and links that we call the extended bracket polynomial, and denote by <<K>> for a virtual knot or link K. This invariant is a state summation over bracket states of the oriented diagram…
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…
In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.
The entanglement of open curves in 3-space appears in many physical systems and affects their material properties and function. A new framework in knot theory was introduced recently, that enables to characterize the complexity of…
We describe an invariant of links in the three-sphere which is closely related to Khovanov's Jones polynomial homology. Our construction replaces the symmetric algebra appearing in Khovanov's definition with an exterior algebra. The two…
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of…
We initiate the study of classical knots through the homotopy class of the n-th evaluation map of the knot, which is the induced map on the compactified n-point configuration space. Sending a knot to its n-th evaluation map realizes the…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…
There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While…
In this paper, we extend the definition of a knotoid that was introduced by Turaev, to multi-linkoids that consist of a number of knot and knotoid components. We study invariants of multi-linkoids that lie in a closed orientable surface,…
We show that embedding calculus invariants $ev_n$ are surjective for long knots in an arbitrary $3$-manifold. This solves some remaining open cases of Goodwillie--Klein--Weiss connectivity estimates, and at the same time confirms one half…
A group invariant for links in thickened closed orientable surfaces is studied. Associated polynomial invariants are defined. The group detects nontriviality of a virtual link and determines its virtual genus.
An embedding is a mapping from a set of nodes of a network into a real vector space. Embeddings can have various aims like capturing the underlying graph topology and structure, node-to-node relationship, or other relevant information about…
Embedding graphs in continous spaces is a key factor in designing and developing algorithms for automatic information extraction to be applied in diverse tasks (e.g., learning, inferring, predicting). The reliability of graph embeddings…
We define some signature invariants for a class of knotted trivalent graphs using branched covers. We relate them to classical signatures of knots and links. Finally, we explain how to compute these invariants through the example of…
We define an invariant of welded virtual knots from each finite crossed module by considering crossed module invariants of ribbon knotted surfaces which are naturally associated with them. We elucidate that the invariants obtained are non…
Exploiting symmetries and invariance in data is a powerful, yet not fully exploited, way to achieve better generalisation with more efficiency. In this paper, we introduce two graph network architectures that are equivariant to several…
Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…