Related papers: Virtual Spatial Graphs
Kauffman virtual knots are knots in thickened surfaces $F\times R$ considered up to isotopy, stabilizations and destabilizations, and diffeomorphisms of $F\times R$ induced by orientation preserving diffeomorphisms of $F$. Similarly,…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
Knot theory provides a powerful tool for the understanding of topological matters in biology, chemistry, and physics. Here knot theory is introduced to describe topological phases in the quantum spin system. Exactly solvable models with…
Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…
This paper aims to develop a mathematical foundation to model knitting with graphs. We provide a precise definition for knit objects with a knot theoretic component and propose a simple undirected graph, a simple directed graph, and a…
Deep learning's success has been widely recognized in a variety of machine learning tasks, including image classification, audio recognition, and natural language processing. As an extension of deep learning beyond these domains, graph…
This paper proposes the definition of a quantum knot as a linear superposition of classical knots in three dimensional space. The definition is constructed and examples are discussed. Then the paper details extensions and also limitations…
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
Virtual links were introduced by Kauffman in 1999. We characterize the virtual link invariants that are partition functions of vertex models (as considered by de la Harpe and Jones), both in the real and in the complex case. We show that…
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…
The aim of this paper is to realise the techniques of picture-valued invariants and invariants valued in free groups for long knots in the full torus. Such knots and links are of a particular interest because of their relation to Legendrian…
We define a generalization of virtual links to arbitrary dimensions by extending the geometric definition due to Carter et al. We show that many homotopy type invariants for classical links extend to invariants of virtual links. We also…
We construct a map from knots to (abstract) 2-knots which can be extended to higher dimensions; this map is the natural "knot" counterpart for "braid" theory of groups $G_{n}^{k}$.
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states and their applications in computing, networking, and sensing.…
The present paper produces examples of Gauss diagram formulae for virtual knot invariants which have no analogue in the classical knot case. These combinatorial formulae contain additional information about how a subdiagram is embedded in a…
Khovanov homology for knots has generated a flurry of activity in the topology community. This paper studies the Khovanov type cohomology for graphs with a special attention to torsions. When the underlying algebra is $\mathbb{Z}[x]/(x^2)$,…
Knowledge graph (KG) embedding aims at learning the latent representations for entities and relations of a KG in continuous vector spaces. An empirical observation is that the head (tail) entities connected by the same relation often share…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…
In the graph node embedding problem, embedding spaces can vary significantly for different data types, leading to the need for different GNN model types. In this paper, we model the embedding update of a node feature as a Hamiltonian orbit…